2. Solve the following linear programming problem using the simplex method and showing your tableaus after the answer box. Maximize z=3x1+x2 s.t. x1+4x28x12x24x1,x2=0. ANSWER (a) (10 points) Does the problem have feasible points? Circle one. Yes No (b) (5 points) Does the problem have a solution? Circle one. Yes No. (c) (10 points) If you circled YES to (b), then the maximum (x1,x2)= and the maximum objective function value = If you circled NO to (b), put NA in the blanks