Consider the canonical form linear program min cx s.t. Ax b and x 0 where 4 6 4 1 ] =[$] b = 5 -3 Run the dual simplex method starting from the basis introduced by the slack variables. Show the successive tableaus, report and note any degeneracy encountered, and give the optimal solution to the primal linear program and to the dual of this linear program. (Note: You are asked to show the optimal variables in the primal and dual linear programs. You may use MATLAB to do all computations, but you must submit a diary.) A = [ -1 3 8 -2 -2 0 1 5 CT = [ 5 2 1 0 1 3 2].