2 [2007 2() [130] Solve the following linear program graphically. Identify the feasible region and the optimal solution. Plot the objective function as a double dashed line broken line (---) through the optimal point Label the feasible extreme polnts starting with the feasible extreme point with coordinatos closest to X1, X2] = 10,0) as A, and continuing counter-clockwise for the other feasible extreme points Minimize 2 - 15 X1 15 X2 2.3 + - 2X1 2 X2 516 (1) 2.X2 516 (2) X2 X2 315 (3) X2 S 9 (4) X2, X2 zo (5) 2 (b) [20] Provide the optimal solution, [x1, x2]' and the optimal value of the objective function, Z' for problem 2 (a). 2 (C) [50] For each feasible Extreme Point in Problem 2 (a), Complete the following table (add additional rows as needed) Point Z Optimal? [y/N] Why? 0.0 0.0 0.0 X2