Return to the improving search problem of Exercise 15-11, starting from x102 = 11, 0, 0, 02. Compute an approximate optimum by Tabu search Algorithm 15C, forbidding complementation of a variable for one step after its value changes, and limiting the search to t max = 5 moves.