Consider the primal-dual method of Chapter 6. Show that if the terms "balanced," "active," and "inactive" are replaced by "-balanced," "-active," and "-inactive," then the resulting method terminates in a finite number of iterations and the final pairs (x, p) obtained satisfy -CS. 7.