2. A linear programming problem is given as follows: Minimize Z-4x1 + x2 Subject to 8x + 2x2 16 4x1 + 2x2 12 x 5 X2 2 X1,X20 (i) [5 Pt.] Find the A, B, C, D and E, F, G, H, K points on the plot below. (ii) [5 Pt.] Identify the feasible solution area graphically on the following plot (by shading the area). x2 F E A (0,0) x1 K H (iii) [5 Pt.] Which points are the extreme points? (iv) [5 Pt.] What is the solution of the optimization problem? (x1-?,x2-?,z=?)