What is the smallest possible number of whole 2-by-3 non-overlapping rectangles needed to cover a square region exactly, without extra over-hangs and without gaps?

an

y = 6x -3y -12

y +3y +12 = 6x

=> . x = { 2y / 3 +2 } this is equation of line in terms of x

=> . if line meets the x-axis the co-ordinates of meeting point would be ( x , 0 )

=> . x = 2 ( 0 ) / 3 + 2

=> . x = 2

so, the point is ( 2 , 0 )

we have the parent function given by,

1. the function is translated 5 units to the left.

so, we get,   becomes

2. the function is translated 5 units to the right.

so, we get,   becomes

3. the function is translated 5 units upwards.

so, we get,   becomes

4. the function is translated 5 units downwards.

so, we get,   becomes

5. the function is reflected across x-axis.

so, we get,   becomes

6. the function is reflected across y-axis.

so, we get,   becomes .

step-by-step explanation:

mark brainliest.