Question 2: Simplex (30 pts) Find the values of the unknowns a through f in the following simplex tableau to satisfy each of the following statements. Any value that makes the statement correct is acceptable. A. The current solution is optimal for a minimization problem in the presence of alternative optimal solutions. a=1,b=2,c= (b), =0,e=1 B. We must resort to one artificial variable. a=1,b C. The current solution is not a BFS for a minimization problem. D. The current basic solution is a degenerate BFS for a minimization problem. The current basic solution is feasible however the optimal solution does not exist. Although the current basic solution is feasible, the objective function value can be improved by replacing x2 as a basic variable with x3 for a maximization