Maxs.t.18x1x13x13x1x1,+8x2+2x2+x2+6x2x2,+10x3+2x3+4x3+2x3x3,+40x4x4+2x4+5x4x4,+15x5+4x5+3x5+x5x5,+30x6+x6x6+3x6x6=6=16=660 Start with variables x1,x2, and x4 basic. Implement the simplex algorithm using the 6 step pseudocode discussed in the class. Use the steepest ascent rule in determining the direction of movement. Use the steepest ascent rule in determining the direction of movement. At each iteration of the algorithm, do the following: (a) Indicate basis B,cB,w=cBB1, and zi, the objective function value. (b) Write down B1A. (c) indicate direction of movement in the (x1,x2,x3,x4,x5,x6) space, and the step size (if it is an improving direction). Do all matrix calculations using computer (MATLAB, Python, Excel, etc.)