Consider the following linear programming problem (problems 7-10) Max 8X1+9X 2 st X1 + 6X2 < 60 2 X1 + 3X2 < 60 X1, X2 ? 0 7. (10) Use a graphical technique to show each constraint and the feasible region. Clearly identify the X1 and X 2 values of each vertex.