Consider the linear optimization model: Maximize 3 2 Subject to 5 + 2 20 2 + 3 12 , 0 (a) Graph the constraints and identify the feasible region. (b) Draw a dotted line representing all combinations of x and y that make the objective function equal to 12. (c) Determine the optimal solution, (x, y). If the optimal solution is at the intersection point of two constraints, find the intersection point by solving the corresponding system of two equations. (d) Label the optimal solution on your graph. (e) Calculate the optimal value of the objective function.