Use the Simplex Method to Solve the Linear Programming Problem $\mathrm{z}=9 \mathrm{x}_{1}+8 \mathrm{x}_{2}$

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

A) Maximum is 17 when $x_{1}=1, x_{2}=1$
B) Maximum is 45 when $x_{1}=5, x_{2}=0$
C) Maximum is 16 when $x_{1}=0, x_{2}=2$
D) Maximum is 18 when $\mathrm{x}_{1}=2, \mathrm{x}_{2}=0$