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?

first one is a: renaming a fraction. second one is c: de-c

step-by-step explanation:

my explanation is that these were the answers on edg : )

1.0

step-by-step explanation:

knlknlkkn

step-by-step explanation:

c.

step-by-step explanation:

substitution for (0,1)

y=x^2+4x+1

1=0^2+4(x)0+1

1=0+4(x)0+1

1=4(x)0+1

1=0+1

1=1

substitution for (-3,-2)

y=x+1

-2=-3+1

-2=-2