3. (6 points) The graphical method still applies to this linear programming problem. A sketch of the feasible region, including the corner points of the region is provided below. Find the solution to the linear programming problem using the graphical method. Show all of your work in the space provided below the figure. a = 3 W= - X - 2q + loz Maximize (0, 0, 1) (o, 0, 1 ) 6 = 9 Subject to C= 27 b x tay t c z cc X 70 , 420 , 2 20 ( 0, 0, 0 ) W=-x- aut loz (0, 0, 0) 9x + 3q + 272 5 27 (0, 6, 0) -y * 20 , 420 , 2 2 0 ( 0 , 4 , 0 ) (a, 0, 02 ( 3 , 0 , 0 ) 4. (5 points) This problem can also be solved using the simplex method. Using your values for a, b and c in part 2 write down the initial tableau for your linear programming problem in the space provided below. Circle the pivot column and row. y Z $1 w 5. (1 point) Is s1 in the tableau in part 4 a slack variable or a surplus variable