] A linear programming problem is given as follows:

min = 41 + 2

Subject to 81 + 22 16

41 + 22 12

1 6

2 4

1, 2 0

(i) [5 Pt.] Find the A, B, C, D, E, F and G points on the plot below.

(ii) [5 Pt.] Identify the feasible solution area graphically on the following plot (by shading the area).

(iii) [5 Pt.] Which points are the extreme points?

(iv) [5 Pt.] What is the solution of the optimization problem? (x1=?,x2=?,z=?) Show your work.