Solve the following optimization problem using the simplex method. At each iteration, record the indices in the basis, x, the reduced costs , the new feasible direction d, and step length o*. Any method to come up with a starting basic feasible solution is ok. minimize 6x1 + 8x2 + 5x3 + 9x4 subject to 2x1 + x2 + x3 + 3x4 = 5 X1 + 3x2 + x3 + 2x4 = 3 x 20