Return to the improving search problem of Exercise 15-11.

(a) Show that x = 11, 0, 0, 02 is a local optimum.

(b) Show that if a nonimproving move is allowed at x = 11, 0, 0, 02, the next iteration will return the search to this same point.