7. You are using the revised simplex method to solve the following linear programming problem: Maximize Z = 4x, +3x, + xy + 2x, Subject to: 4x, +2x, + x + x 55 3x, + x, + 2x, +x, 54 X, 20, x, 20, X, 20 x 20 Coefficient BV N * x 23 x X x RHS Let X, and xdenote the slack variables for the first and second constraints, respectively. Suppose that after some number of iterations of the simplex method, a portion of the current simplex tableau is as follows: N 1 -2 4 x 0 1 - 1 X, 0 -3 4 1 Complete the table by using the fundamental insight for the revised simplex method