$(25)$ Solve the following LP using the big$-$M simplex method $($yes$,$ the problem is trivial; but the point here is to use the big$-$M method$).$ Are there alternative optimal solutions? How many optimal bfs$$s are there? min z $=2$x$1+2$x$2$ s$.$t$.$ x$1+$ x$2=23$x$1+3$x$2=64$x$1+4$x$2=8$ x$1,$ x$20$