Question: 3 Assume that we got the following Simplex Table while we were solving a minimization type LP model by the Simplex Algorithm. Does the following Simplex Table show the optimal solution? If it does not show the optimal solution continue to search by the Simplex Algorithm until finding the answer. At the end write the values of all the decision variables and objective function if you end up with an optimal solution. If you do not end up with an optimal solution write your conclusion: infeasible solution or unbounded solution. X S Basis X 4 s2 RH S 3 6 0 2 0 -2 3 80 Min Z X2 X4 4 1 2 0 60 01 - 1 2 2 0 5 10