Exercise 4.25 This exercise shows that if we bring the dual problem into stan- dard form and then apply the primal simplex method, the resulting algorithm is not identical to the dual simplex method. Consider the following standard form problem and its dual. minimize 1 + x2 maximize p1 + p2 subject to 1z =1 subject to p; 0 Here, there is only one possible basis and the dual simplex method must terminate immediately. Show that if the dual problem is converted into standard form and the primal simplex method is applied to it, one or more changes of basis may be required