Simplex Algorithm$-$Tabular Solution

Solve the following mathematical model using the simplex method in Tabular form. For each iteration, determine the value of all variables, the basic variables, the non$-$basic variables, the entering basic $($pivot column$)$ variables, the leaving basic variables $($pivot row$),$ and the value of the objective function. Label the equations properly and show your work in detail. In addition, for each iteration $($solution$)$ determine which corner point feasible solution it represents.

Objective function

$-$ max$3x_1+5x_2$

$s.t.$

$x_{1}4$

$2x_{2}12$

$3x_1+2x_{2}18$

$x_{1}0,x_{2}0$