please slove problem 4 using the graphical and simplex basics

Problem 4 (Graphical Method and Simplex Basics) (30 pts.) Consider the following linear programming model: max z = 2.01 +32 (0) subject to x + 3x2 36 (1) 3x + 2x2 0. 1. Solve the problem graphically, by plotting the feasible region and the objective function line. 2. Express the problem in equation form. 3. Determine all the basic solutions of the problem, and identify the corresponding basic and non- basic variables. 4. Classify the basic solutions as feasible and infeasible, identify these solutions on the graph, and determine the optimal solution by substitution in the objective function. You can answer (C) and (d) above by completing the table below for all basic solutions that you identify Non-basic variable Basic variable Basic solution Feasible? Point on graph Objective value