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

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

A) Maximum is 18 when $x_{1}=0, x_{2}=6$
B) Maximum is 9 when $x_{1}=0, x_{2}=3$
C) Maximum is 30 when $x_{1}=6, x_{2}=0$
D) Maximum is 32.5 when $\mathrm{x}_{1}=6.5, \mathrm{x}_{2}=0$