Consider the following linear programming problem: Max Z = x, + 3x2 subject to: 2x1+ X2 = 0 (C4, C5 ) a. (10 pts) Graph the constraints (Cl, C2, C3, C4, C5). b. (5 pts) Shade the feasible region in the graph. c. (5 pts) Determine the coordinates of the vertices of the feasible region. d. (5 pts) Identify and label the optimal solution in the figure. Give the optimal value of the objective function. d. (5 pts) Identify and label the Time left 0:59:33 solution in the figure. Give the optimal value of the objective function. x2 20 18 16 14 12 10 Instructions: 1. Write your answer on a blank paper. 2. Take a picture or scan, and then upload.