Given the following allowable ranges for the objective coefficients: Adjustable Cells Cell Name Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 2. 0 3,000 4,500 3,000 6 0 5,000 1E+30 3,000 5C512 Batches Produced Doors 5D512 Batches Produced Windows a. The problem is unbounded due to infinite allowable increase of C2 b. The problem has multiple optima since allowable ranges for both objective coefficients are both positive C. Multiple optimality has nothing to do with sensitivity analysis d. The final values are the only optimal solution of the problem since allowable ranges for both objective coefficients are both positive In the next to last simplex iteration, the feasible solution of a problem is : (4,3,0,6,0), which of the following answers would be the corresponding complementary basic solution of the dual problem in that same iteration? a. (3, 0, 0, 0, -5) b. (3, 0, 0, 0,5) C. (-9/2, 0, 5/2, 0, 0) d. (9/2, 0, 5/2, 0, 0 )