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

Multiple Choice

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

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