Consider the following linear program: + 422 maximize subject to + 12 -8 5x1 21 -2.31 1 22 + + AL VI VI 1 3 X1 > 0,22 > 0 8. Draw the feasible region for this linear program. 9. Introduce slack variables S1, S2, S3 (where si corresponds to the i-th constraint), and insert these into the linear program to make the constraints equations. 10. For each corner point of the feasible region, determine the associated basic solution. (For this question you do not necessarily have to apply the Simplex method; you can directly retrieve the basic solutions from the corner points.)