PROBLEM $1(50$ points$)$

Consider the following linear programing problem:

Maximize $Z=2x_1+4x_2+3x_3$

Subject $to$: $3x_1+4x_2+2x_{3}60$

$2x_1+x_2+2x_{3}40$

$x_1+3x_2+2x_{3}80$

$x_1,x_2,x_{3}0$

Solve the problem using the Simplex Method in tabular form. $($All tableaus and calculations must be shown$).$