Problem 2 . The following LP starts at an infeasible basis. Follow the steps to use the TwoPhased-Simplex algorithm and find a feasible basic solution. Minimizex1x2s.t.x1+3x25x1+2x2x2x61040 (a) Put the model in the canonical form for the basis {s1,s2,s3}. The associated solution should be infeasible. How can we tell? b) Create the phase one LP by subtracting an auxiliary variable ( a1 and a2) from each of the constraints that have negative right-hand-side and replacing the objective function with "Maximize a1a2." Problem 2 . The following LP starts at an infeasible basis. Follow the steps to use the TwoPhased-Simplex algorithm and find a feasible basic solution. Minimizex1x2s.t.x1+3x25x1+2x2x2x61040 (a) Put the model in the canonical form for the basis {s1,s2,s3}. The associated solution should be infeasible. How can we tell? b) Create the phase one LP by subtracting an auxiliary variable ( a1 and a2) from each of the constraints that have negative right-hand-side and replacing the objective function with "Maximize a1a2