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

Multiple Choice

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

A) Maximum is 20 when $x_{1}=0, x_{2}=4, x_{3}=0$
B) Maximum is 60 when $x_{1}=0, x_{2}=9, x_{3}=5$
C) Maximum is 45 when $x_{1}=0, x_{2}=9, x_{3}=0$
D) Maximum is 12 when $x_{1}=6, x_{2}=0, x_{3}=0$