Problem 1 Consider the linear programming problem below. Maximize z =x1 + 2x2 + 3x3 subject to 2x1 + 5202 + C3 20 I VI 3x1 + + 4x2 2x3 24 x1 20, x2 2 0, X3 2 0 After adding the slack variables x4 and x5, the final tableau at the end of simplex method is: O 83 L3 OO H O HIN O HIN HIN O NICO NICO O Use the dual simplex method to find a solution to the linear programming problem formed by adding the two constraints below to this problem. + + 3x3 2x1 + 2 + <