Consider the following linear programming model Max 2X1 - 3X2 Subject to X1 X224 X1 22 X1, X220 This linear programming model has: A redundant constraints B) infeasible solution alternate optimal solution D unique solution E unbounded solution Figure 1 A C D 1 Unido 2 X: Numberto Make OR IN VALUE 4 5 54 50 6 Contraints 3 1 1 40 12 10 120 10 Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming problem Max 4X13X2 3 X 5 X 40 12X, 10X2 120 X 15 X1 X30 Note: Cells 83 and are the designated cells for the optimal values of X, and respectively, while cell 4 is the designated cel for the objective function value. Cells De 10 designate the left-hand side of the constraints. Refer to Figure 1. What formula should be entered in cell to compute the amount of resource that is consumed A-09090909 B-SUMPRODUCT(12.02.09.09) C SUMD9.09) D-SUMPRODUCT/33:03, BC SUMPRODUCT(89.CO,BS-C51