Consider the following linear programming problem: Maximize 40 X1 + 30 X2 + 60X3 Subject to: X1 + X2 + X3 90 12 X1 + 8 X2 + 10 X3 1500 X1 = 20 X3 100 X1, X2, X3 0 How many slack, surplus, and artificial variables would be necessary if the simplex algorithm were used to solve this problem? Select one: O a. 2 slack, 1 surplus, and 2 artificial O b. 1 slack, 2 surplus, and 1 artificial O C. 3 slack, 6 surplus, and 6 artificial O d. 1 slack, 2 surplus, and 2 artificial

Subjectto:X1+X2+X390121+82+1031500X1=20X3100X1,X2,X30 How many slack, surplus, and artificial variables would be necessary if the simplex algorithm were used to solve this problem? Select one: a. 2 slack, 1 surplus, and 2 artificial b. 1 slack, 2 surplus, and 1 artificial c. 3 slack, 6 surplus, and 6 artificial d. 1 slack, 2 surplus, and 2 artificial