Consider the Following Linear Programming Problem: Maximize 40 X₁

Consider the following linear programming problem: Maximize 40 X₁ + 30 X₂ + 60X₃
Subject to: X₁ + X₂ + X₃ ≥ 90
12 X₁ + 8 X₂ + 10 X₃ ≤ 1500
X₁ = 20
X₃ ≤ 100
X₁ ,X₂ ,X₃ ≥ 0
How many slack,surplus,and artificial variables would be necessary if the simplex algorithm were used to solve this problem?

A) 3 slack,6 surplus,and 6 artificial
B) 2 slack,1 surplus,and 2 artificial
C) 1 slack,2 surplus,and 2 artificial
D) 1 slack,2 surplus,and 1 artificial
E) None of the above