Time left $0$:$59$:$10$

Consider the following linear programming

problem:

Maximize $401+302+603$

Subject to: $,x1+x2+x390$

$121+82+1031500$

$x1,x2,x30.$

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$.3$ slack, $3$ surplus, and $3$ artificial

c$.1$ slack, $1$ surplus, and $1$ artificial

d$.1$ slack, $4$ surplus, and $4$ artificial