You are given a linear programming problem. Maximize P = 3.5x + 3y subject to 5x + 3y 30 2x + 3y 21 XS 4 Resource 1 Resource 2 Resource 3 x 0 (a) Use the method of corners to solve the problem. The maximum is P = at (x, y) = (b) Suppose P = cx + 3y. Find the range of values that the coefficient c of x can assume without changing the optimal solution. SCS (c) Find the range of values that Resource 1 can assume. $ (Resource 1) (d) Find the shadow price for Resource 1. (e) Identify the binding and nonbinding constraints. constraint 1 -Select- constraint 2 -Select-- constraint 3 Select--