Can you help me with this problem in the link

the graph in the attached figure

step-by-step explanation:

we have

using a graphing tool

the graph in the attached figure

the roots are ( x-intercepts) x=-0.5,x=1,x=3

the y-intercept is the point (0,3)

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: