Remaining Time: 58 minutes, 28 seconds Question Completion Status: Question 12 (CLO 3) Consider the following linear programming problem Maximize Z - 25X1 +32X2-64X3 Subject to: 3X1 +2X2+X3590 4X1 +2X2-2X3290 9X1 +7X2+12X351500 4X2560 2X3250 X1, X2, X320 How many slack, surplus, and artificial variables would be necessary if the simplex algorithm were used to solve this problema 3 slack, 2 surplus, and 0 artificial 1 surplus, 3 slack, and 2 artificial 2 surplus, 3 slack, and 1 artificial 3 slack, 2 surplus, and 2 artificial L A Moving to another question will save this response