Serenity brought 4 pounds of apples for 7.20 how many apples can she buy for 27.00

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol

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

range =5

step-by-step explanation:

to find the range, we take the largest value and subtract the smallest value.

the largest value is 5

the smallest value is 0

the range is 5-0   =5