Answer:
The maximum value of C is 68
Step-by-step explanation:
we have the following constraints
----> constraint A
----> constraint B
----> constraint C
----> constraint D
Find out the area of the feasible region, using a graphing tool
The vertices of the feasible region are
(0,0),(5,19),(5,0)
see the attached figure
To find out the maximum value of the objective function C, substitute the value of x and the value of y of each vertex in the objective function and then compare the results

For (0,0) -----> 
For (5,19) -----> 
For (5,0) -----> 
therefore
The maximum value of C is 68
y = (3x)/2 + 2
Slope = 3/2
y-intercept = 2
The first point is y-intercept when x = 0 = (0,2). Now according to our slope we move 3 up (Why up? Because it's positive) and 2 right (Why right? Because it's positive).
When you move 3 up from (0,2), you get (0,5) and move 2 right which is (2,5).
Remember: slope = change in y / change in x
Points: (0,2) and (2,5)
Answer:
I think the answer should be Mat A cause it has more space.
C. 0<p<3 is the answer (at most)
Hope dis helped :)
Eighteen trillion four hundred twenty nine billion fifty thousand