\f(b) Rewrite the LP in matrix equality form. rThat is, identify the matrix A and vectors b and C so that the following LP is equivalent to our problem. Maximize CTX s.t. AX : b x 2 0 (Hint: Our problem has four constraints and six variables (including slack); thus A should be a 4 x 6 matrix. b should be a l x 4 vector, and C should be a l x 6 vector.) (c) Notice that your A matrix from part (b) is not in the. canonical form for any feasible basis For now, let B : {51, 52, 53, my} and N : {3319,5612} be the target basis and compute the canonical form of the constraints. (d) Identify the basic solution and objective function value associated with the new basis. (e) Identify the canonical form of the objective function for the current basis [B : {81, 52, 53, my} and N = {533, 533]). Given this version of the function, is our basic solution optimal? Why? (t) From here' what basis does the simplex method tell us to pivot into next? Does this agree with the optimal solution we found in Class"? (see Canvas -> Files -> Lecture Notes -> Lecture9_HW1.1a&4_solver.) Solution: B : {51.1'R,53,1'y} and N : {1'3T 52}