I wanna see how quick yall answer these questions so free points !

fast

Step-by-step explanation:

HAHA THANKS :))

Step-by-step explanation:

<333333

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

sample answer: you can determine whether each element of the domain is paired with exactly one element of the range. for example, if given a graph, you could use the vertical line test; if a vertical line intersects the graph more than once, then the relation that the graph represents is not a function.