Use the Simplex Method to Solve the Linear Programming Problem $z=x_{1}+3 x_{2}+x_{3}+2 x_{4}$

Multiple Choice

Use the simplex method to solve the linear programming problem.
-Maximize $z=x_{1}+3 x_{2}+x_{3}+2 x_{4}$
Subject to: $2 x_{1}+x_{2}+5 x_{3}+6 x_{4} \leq 25$
$5 x_{1}+3 x_{2}+4 x_{3}+x_{4} \leq 60$
With
$$x_{1} \geq 0, x_{2} \geq 0, x_{3} \geq 0, x_{4} \geq 0$$

A) Maximum is 50 when $x_{1}=0, x_{2}=0, x_{3}=0, x_{4}=25$
B) Maximum is 75 when $x_{1}=0, x_{2}=25, x_{3}=0, x_{4}=0$
C) Maximum is 36 when $x_{1}=0, x_{2}=10, x_{3}=0, x_{4}=3$
D) Maximum is 60 when $x_{1}=0, x_{2}=20, x_{3}=0, x_{4}=0$