1. the fabric josef is using comes in 100 square-inch pieces that cost $6.25 each. what will his fabric cost? show your work.

2. a student made a toy chest for his baby sister's square building blocks. six layers of blocks can fit in the box, and each layer has 15 blocks. how many building blocks can the toy chest hold? show your work.

The asnwers for your two question problem are

1. $625

2. 90 building blocks

Step-by-step explanation:

First problem

The fabric Josef is using comes in 100 square-inch pieces that cost $6.25 each. What will his fabric cost?

* The fabric has 100 pieces

* Each piece costs $6.25

Total amount for the fabric  = $6.25*100 = $625

Second problem

A student made a toy chest for his baby sister's square building blocks. Six layers of blocks can fit in the box, and each layer has 15 blocks. How many building blocks can the toy chest hold?

* 6  layers of blocks fit in the box

* Each layer has 15 blocks

Total amount of blocks = 6*15 blocks  = 90 blocks

false

step-by-step explanation:

rulers and compasses arent required in order to bisect an angle because when bisecting angles, you're making a "half circle" and considering in order to bisect an angle it wouldn't be straight, you wouldn't need either of the two

so firstly, we need to isolate the y variables to be able to solve these inequalities. firstly, add 0.5x on both sides of the first inequality and subtract 1.5x on both sides of the second inequality:

now since the slope is positive for the first inequality, this means that the line going upwards belongs to the first inequality, and the line going downwards belongs to the second inequality.

next, since y ≥ in the first inequality, this means that the shaded region will be above the first inequality's line, thus shading regions a and b.

next, since y ≤ in the second inequality, this means that the shaded region is going to be below this line, thus shading regions a and c.

since both lines shade region a, this means that region a is the solution.

step-by-step explanation:

mark brainliest!