Return to the improving search problem of Exercise 15-11, starting from x102 = 10, 0, 0, 12. Compute an approximate optimum by Simulated Annealing Algorithm 15D, using a temperature of q = 20, limiting the search to t max = 4 moves, and resolving probabilistic decisions with (uniform [0,1]) random numbers 0.65, 0.10, 0.40, 0.53, 0.33, 0.98, 0.88, 0.37.