Consider the following linear programming model: Minz=2x1x2s.a.4x1+3x2124x1+x284x1+2x28x1,x20 After introducing the deviation variables x3,x4 and x5 in the first, second and third constraint, respectively, we solve the problem with the simplex algorithm and we obtain the following optimal table: By simply examining this table, explain why there is more than one optimal solution to the problem. Then show how another optimal base solution can be obtained from this table