In Exercises $1-4,$ write the simplex tableau for the given linear programming problem. You need to solve the problem. $($ in each case the objective function is to be maximized.$)$

$1.$ Objective function: $2.$ Objective function

$2=$ x$1+2$x$2==$ x$1+3$x$2$

Constraints: Constraints

$2$x$,+$ x$258+=4$

$1=0*1.7,=0$

$3.$ Objective function: $4.$ Objective funetion:

$2-2$X$1+332+433==6$x$1=9$x$,$

Constrats: Constaits

x$1+2$x$2$

$512-31=32=6$

$+23=81+3320$