3 49 Consider the following LP text Maximize z 3 x 1 2 x 2 3 x 3 subject to begin array c 2 x 1 x 2 x 3 leq 2 11 3 x 1 4 x 2 2 x 3 geq 8 x 1 x 2 x 3 geq 0 end array The optimal simplex tableau at the end of Phase I is Explain why the nonbasic variables and X1 X3 X4 X5 can never assume positive values at the end of Phase II Hence conclude that their columns can be dropped before we start Phase II In essence the removal of these variables reduces the constraint equations of the problem to x 2 meaning that it is not necessary to carry out Phase II in this problem