A catering service offers 11 appetizers, 5 main courses, and 6 desserts. A customer is to select 8 appetizers, 4 main courses, and 3 desserts for a banquet. In how many ways can this be done?

no, because the sides are not congruent

c

step-by-step explanation:

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 image is given below

since the options are not given so we draw it from the equation

the given equation is

y = (x-1) (x+4)

y = y² + 3x - 4

the above equation is a quadratic equation which will have two roots. if we draw the graph for it, it will look like this