You are given the following tableau for a maximization problem. Give conditions on the unknowns a1,a2,a3,b,c1, and c2 that make the following statements true: a. The current solution is optimal, and there are alternative optimal solutions. (2 pts) b. The current basic solution is not a basic feasible solution. (1 pt) c. The current basic solution is a degenerate basic feasible solution. (1 pt) d. The current basic solution is feasible, but the LP is unbounded. (4 pts) e. The next simplex iteration corresponds to a degenerate solution. ( 8pts )