Consider the following LP in standard form Max S. t 15% +30% + 24x3 + 40 x4 + 20xs + 2×1 4x6 + 3x + x3 +5x4 + 3x + 8x6 = 66 = 6 4x + x2 + 4x3 - ** + *5 +3×6 -x1 = x2 + 3x3 + 2x4 - 3x5 + 2x6 = -16 X3, X4 x5 хь Start with variables x, xs and x6 basic. Implement the simplex algorithm using the seven step pseudocode. Use the steepest ascent rule in determining the direction of movement. At each Iteration of the algorithm, a) Indicate basis B, CB and w= b) Indicate 2; the objective function value at iteration i c) Direction of movement in the (x1, x2, x3, x4, xs, xb) space and the step size (if it is an improving direction)