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

Multiple Choice

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

A) Maximum is 24 when $x_{1}=6, x_{2}=0$
B) Maximum is 56 when $\mathrm{x}_{1}=14, \mathrm{x}_{2}=0$
C) Maximum is 14.6 when $\mathrm{x}_{1}=2.5, \mathrm{x}_{2}=2.3$
D) Maximum is 12 when $x_{1}=6, x_{2}=0$