minimize *1 2x2 subject to -*1 3x2 -3, 2x1 + 1, XI Put the constraints into the standard form X7 XA where [ X1 , X2, X3, X4 20. Apply the two-phase simplex method to find an optimal solution and the optimal value for this problem, starting with the basic variables indicated in the first tableau. Use Bland's rule: if there is more than than one choice for the entering or exiting variable, always choose the one with the lowest subscript. Indicate the entering and exiting variable by appending ! to the variable name (for example x1! for an entering variable and x2!=... for an exiting variable). If a column A, is a positive multiple of a unit vector ex, use the corresponding decision variable x, as a proxy basic variable and remove the artificial variable ), from the constraints. However, since x, is merely acting as a proxy for the basic variable xx, the reduced cost of x, and the negative cost are the same as without this optimization. Phase I: CX x1 x2 X3 X4 x5 X5 0 CX X1 x2 x3 X4 X5 XE XE-CX x1 x2 x3 *4 *5 -CX x1 x2 x3 x4 x5 XE XE Phase II: -CX x2 x3 x4 -CX x1 x2 x3 x4 The linear programming problem is then seen to be (No answer given) # Enter a value, inf, -inf, or leave blank, as appropriate: the optimal value is Use your final tableau to complete the next two fields. If the problem is:Use your final tableau to complete the next two fields. If the problem is: . optimal, enter the optimal solution x; . unbounded, enter a solution x(1) = x + rd, such that lim c x(1) = -co; 1-+00 . infeasible, leave both fields blank. Standard form: Original