Question 2: Full Simplex Algorithm Consider the following LP. We'll use the full Simplex algorithm to solve it. min6x1+3x2+7x35x1+x2=8x1+x220x2+x32x1,x2,x30 (a) First, convert the problem to standard form. We will use the Two Phase method to find an initial BFS. (b) Provide the formulation for Phase 1. (c) Using Simplex tableaux, solve the Phase 1 formulation to optimality. Show work. This is a feasible LP, and you should end up with an optimal solution to part (c) that has a value of 0 for the artificial variable(s). Drop the artificial variable(s), and now you have a feasible, initial BFS to the standard form LP presented in part (a). Now we will conduct Phase 2 - solving the LP with this initial BFS. (d) Report the tableau that will start Phase 2. Note: it should not include the artificial variables. (e) Solve this Phase 2 problem to optimality using tableaux. Show work, and briefly note how you know the solution is optimal. (f) Report the optimal solution and optimal value. Question 2: Full Simplex Algorithm Consider the following LP. We'll use the full Simplex algorithm to solve it. min6x1+3x2+7x35x1+x2=8x1+x220x2+x32x1,x2,x30 (a) First, convert the problem to standard form. We will use the Two Phase method to find an initial BFS. (b) Provide the formulation for Phase 1. (c) Using Simplex tableaux, solve the Phase 1 formulation to optimality. Show work. This is a feasible LP, and you should end up with an optimal solution to part (c) that has a value of 0 for the artificial variable(s). Drop the artificial variable(s), and now you have a feasible, initial BFS to the standard form LP presented in part (a). Now we will conduct Phase 2 - solving the LP with this initial BFS. (d) Report the tableau that will start Phase 2. Note: it should not include the artificial variables. (e) Solve this Phase 2 problem to optimality using tableaux. Show work, and briefly note how you know the solution is optimal. (f) Report the optimal solution and optimal value