Consider the following linear programming problem: Maximize $40$ X$1+30$ X$2+60$X$3$ Subject to: X$1+$ X$2+$ X$3>=9012$ X$1+8$ X$2+10$ X$3<=1500$ X$1,$ X$2,$ X$3>=0.$ How many slack, surplus, and artificial variables would be necessary if the simplex were used to solve this problem? Select one: a$.1$ slack, $2$ surplus, and $2$ artificial b$.1$ slack, $4$ surplus, and $4$ artificial c$.3$ slack, $3$ surplus, and $3$ artificial d$.1$ slack, $1$ surplus, and $1$ artificial