Prove that in the primal$-$dual algorithm the cost of the feasible solution in D increases by a positive amount during each iteration. Explain why this does not imply that the method terminates ni a finite number of steps, as it would for simplex.