Please don't skip any steps thanks

This problem is based on following linear programming formulation. max z = 2x1 + 3x2 1 1 s. t. - 60 X2 5 1 40 1 1 50 X1 + 50 X2 1 X1, X2 20 1. Please use the graphical method to solve this linear programming problem. You need to strictly follow the steps we have learned in class, i.e., identify the constraint, mark the arrow for valid side, shadow the feasible region, specify the feasible point you pick for the first objective line, draw the first objective line, draw the final optimal objective line, mark the optimal solution, and write the optimal point value, as well as the optimal objective value. 2. Please list four cases of optimal solutions of linear programming we have learned in class. Circle the case applicable for this problem. 3. How would you change your objective function to change this question to other three cases? You only need to write down one possible case