You are given a linear programming problem. MaximizesubjecttoP=7.5x+4y2x+3y122x+y8y0x0Resource1Resource2 (a) Use the method of corners to solve the problem. The maximum is P= at (x,y)=( (b) Suppose P=cx+4y. Find the range of values that the coefficient c of x can assume without changing the optimal solution. c (c) Find the range of values that Resource 1 can assume. (Resource1) (d) Find the shadow price for Resource 1. (e) Identify the binding and nonbinding constraints. constraint 1 constraint 2