Consider the example of a nonconvex programming problem given in follows. Maximize Z = 0.5x2 - 6x* + 24.5x3 - 39x2 + 20x, subject to x$ 5 x 0, Using x = 2.5 as the initial trial solution, perform six iterations of the basic simulated annealing algorithm by hand. Follow the instructions given at the beginning to obtain the random numbers. For each T value, perform two iterations. Show your work, including the use of the random numbers.

Write a computer programming (pyhton) code that solve the problem in question2 using simulated annealing algorithm and represent the solution. (You can use Pyhton.)