Each of the following shows the sequence of points visited by an improving search. Compute the corresponding sequence of move directions assuming that all step sizes =1=1.

(a) w(0)=(4,0,7)w(0)=(4,0,7), w(1)=(4,2,10)w(1)=(4,2,10), w(2)=(2,4,5)w(2)=(2,4,5), w(3)=(5,5,5)