A)

Consider this linear program: Minimize Z = 48x + 49y Subject to 1 (C1) 11 Fe + 4y 2 22 (C2) 9 (C3) 1 (CA) I, y 0 (a) Graph the feasible region for the constraints. (509) Drawing the feasible region requires 3 mouse clicks for each constraint. Use the first two clicks to draw the line and the third click to select the region satisfying the constraint. 5 5 2 2 5 6 Clear All Draw:(b) Graph only the feasible region. (10%) Click once on each corner point of the feasible region to draw it. Then click on the first point again to close and shade it. 7. 6 5 3 2 4 6 Clear All Draw: Polygon(c) State the optimal solution point and the objective function value. (30%) Enter your answers below as fractions or decimals accurate to at least 3 decimal places. Do not use rounded values to calculate the objective function value. Use exact values. The optimal solution occurs at y The optimal objective function value, Z = (d) At optimal solution, which constraints are non-binding? (108) Select all that apply. O C2 O C's O CA Submit