Q.1. Consider the following LP in standard form. Max 10x1 +15x2 +12x3 +20x4 +10x5 +4x6 s.t. -x1 2x1 +3.x2 4x1 +22 -x2 +23 +4x3 +3x3 +2x4 +5x4 -24 +3x5 +8x6 = 33 +x5 +3x6 -3x5 +2x6 = 3 = −8 21, 22, 23, 24, 25, 26 ≥ 0 Start with variables x4, 5, and 6 basic. Implement the simplex algorithm using the 7 step pseudocode discussed in the class. Use the steepest ascent rule in determining the direction of movement. At each iteration i of the algorithm, (a) Indicate basis B, CB, and w=CBB-¹. (b) Indicate zi, the objective function value at iteration i (c) Direction of movement in the (x1, x2, x3, 24, 25, 26) space, and the step size (if it is an improving direction). Use all matrix calculations using computer (MATLAB, Python, Excel, etc.).