3. (25 pts.) In the tableau for maximization problem below, the values of the six consta istants 0.0.0. B. Pip; are unknown (assume there are no artificial variables): X 4 IS X6 Soln Basic var Z 0 3 0 Pi 4 - 1 0 1 X2 ta 0 P2 a -5 -3 0 30 f 2 3 a -1 -4 1 0 0 1 X as 0 0 State restrictions on the six unknowns (@, 23, as, B. pip:) which would make the following statements true about the given tableau: a. The current solution is optimal but alternate optimum exists. b. The current solution is degenerate basic feasible solution. c. The problem has no finite optimum. d. The current solution is the unique optimum solution e. The current solution is feasible but the objective can be improved by replacing x. by A1