1. The following table corresponds to the initial tableau of a LP problem to be solved using the Simplex Method. a. Show the tables corresponding to all iterations necessary to reach an optimal solution b. Explicitly give the optimal value of all variables. If there are multiple bfs optimal solutions, find them. Basis Z X1 X2 X3 X4 S1 S2 S3 S4 RHS Z 1 -10.6480 -4.8400 -2.2000 -1 0 0 0 0 0.000 S1 0 1.0000 0.0000 0.0000 0 1 0 0 0 1.000 S2 0 4.4000 1.0000 0.0000 0 0 1 0 4.840 S3 0 9.6800 4.4000 1.0000 0 0 0 1 0 23.426 S4 0 21.2960 9.6800 4.4000 1 0 0 0 1 113.380