Problem 6 - The tableau given below corresponds to a maximization problem in decision variables xj 2 0,j=1, 2, ...,5: X1 X2 X3 X4 X5 Basic variables X3 X4 X5 (-2) -1 az a -4 3 -2 1 0 0 0 0 1 0 0 0 0 1 0 Current values (bi) 4 1 b -10 For each of the following four situations, state conditions on all five unknowns a1, az, a3, b, and c, such that the statement is true. a) The current solution is optimal. There are multiple optimal solutions. b) The problem is unbounded. c) The problem is infeasible. d) The current solution is not optimal (assume that b 2 0). Indicate the variable that enters the basis, the one that leaves the basis, and what total change in the objective function would result from one iteration of the simplex method for all values of the unknown that are not optimal. Note: this is a parametric analysis, you are not expected to find exact numerical results