Consider the following LP model with two decision variables, two problem constraints, and two nonnegativity constraints: a. [4 points] Transform the two problem constraint inequalities to equations by using either slack or surplus variables as needed. b. [5 points] One basic solution to the problem in part (a) is (0,0,32,84). There are five other basic solutions. Algebraically compute these five basic solutions, and for each one indicate whether it is feasible or not feasible. Do not graph the feasible region. c. [3 points] Of the six total basic solutions, which is the optimal solution for this problem? Do not use Julia or TORA