$4-11.$ Solve the following linear programming model by the simplex method:

Maximize $Z=$$$48x_1+$$$64x_2$

subject $to16x_1+12x_{2}96$

$8x_1+16x_{2}80$

$4x_{1}16$

$x_1,x_{2}0$