In cases like these, you simply have to multiply the choices you have for each step.
In fact, you can choose between 4 different crusts. For each of these crusts you can choose 4 different sauces. This means that there are
choices at this point. In fact, if we call the crust options 1,2,3,4 and the sauce options A,B,C,D, the 16 possible combinations are

From here, you keep going multiplying the number of options for each step, for a total of

Answer:
2. (5, -5)
3. (-3, 2)
4. (2, 4)
Step-by-step explanation:
Each vertex can be found using two simple steps.
1) The number being added or subtracted from x.
-The x coordinate of your vertex is the opposite of that number.
2) The number after the absolute value symbol.
-The y coordinate is that value.
Answer: 14/5
Step-by-step explanation:
The maximized value of the function is (c) 119/2
<h3>Maximization problem</h3>
Maximization problems are used to determine the optimal solution of a linear programming model
<h3>Objective function</h3>
The objective function is given as:

<h3>Constraints</h3>
The constraints are given as:



<h3>Graph</h3>
See attachment for the graph of the constraints
From the graph, the optimal solution is: (2.83, 2.83)
So, the maximized value is:



Approximate

Rewrite as a fraction

Hence, the maximized value of the function is (c) 119/2
Read more about maximization problem at:
brainly.com/question/16826001