The shaded region in following figure illustrates the unbounded feasible region of a linear programming problem. Given the objective function P 2x + 3y, which of the following is TRUE? * I. The...

Answer the following questions

Extracted text: The shaded region in following figure illustrates the unbounded feasible region of a linear programming problem. Given the objective function P 2x + 3y, which of the following is TRUE? * I. The maximum of P is 18 at A = (0, 6). II. The minimum of P is O at O = (0, 0). II. The maximum of P is 21 at D = (7, 0). IV. The minimum of P is 11 at C = (4, 1). A (0,6) • S B (2,3) C (4,1) . O (0,0) D (7,0) O I only Il and II II and IV O Iv only Find the solution set for the constraints in the figure below. * 3x + 2y s5 2x + 5y s6 3x -y s1 X 20, y 20 B. A O E