Use Big M and $2$ Phase algorithms to solve the following Linear Programming model.

Clearly otate the ontimal solution and the values for decision variables vou obtained from

the optimal tableau and compare the two solutions:

maxZ$=,3x_1+x_2+2x_3$

$s.t.2x_1+x_2+2x_{3}6$

$,x_1+x_2+x_3=4$

$,x_1+2x_2+x_{3}6$

$,x_1,x_2,x_{3}0$