Write the quadratic equation whose roots are 4 and -3, and whose leading coefficient is 2. (Use the letter x to represent the variable.)

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

the answer should be a. snail