Compute the objective function value for the following problem: Min 252X + 132Y subject to : 2X>=0 ;21X + 11Y = 231; X+Y>=0 a. 0 b. 2772 c. unbounded d. infeasible e. 453.72726 Consider the following LP problem with two constraints: 2X + 48Y >= 96and 1X + 18Y= 18. The objective function is Min 13X + 24Y. What combination of X and Y will yield the optimum solution for this problem? a. 6, 0.666667 b. infeasible problem c. unbounded problem d. 0,1 e. 18,0 A Linear programming problem has the following three constraints: 34X + 42Y <= 1428; 19X + 22Y= 418; and 12X - Y <= 186.818. The objective function is Min 10X + 13Y. What combination of X and Y will yield the optimum solution for this problem? a. unbounded problem b. 22,0 c. 16, 5.18182 d. 0, 19 e. infeasible problem