Calculate the optimal solution of the linear programming model below using the revised simplex algorithm.

Max Z$=3$X$1+4$X$2+$X$3$

s$.$t$.$

$4$X$1+7$X$2+$X$328$

$2$X$1+$X$2+5$X$310$

X$1+2$X$2+$X$310$

X$1,$X$2,$X$30$

Please show the solution with all its steps. $($please do not use Python or another software language. I need tables, calculations. The result is nineteen but I do not understand steps$)$