Solve the following LP using the Simplex algorithm and the Matlab program dictionary.m$.$ Use B $=4,5,6$ and N $=1,2,3$ as the starting feasible partition. Submit your Matlab command and output for all steps. If the LP is optimal, then give the optimal solution, the optimal objective value, and the shadow prices for the three constraints $(6)-(8).$ If the LP is unbounded, then give a feasible solution and a recession direction. max $\backslash$zeta $=$ x$2+2$x$3(5)$ s$.$ t$.2$x$1$ x$2+$ x$3<=5(6)3$x$1+$ x$2<=3(7)$ x$2$