Please solve step by step and manual.

2. Consider the example of a nonconvex programming problem given in follows. MaximizeZ=0.5x56x4+24.5x339x2+20x,subjecttox5x0 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. 2. Consider the example of a nonconvex programming problem given in follows. MaximizeZ=0.5x56x4+24.5x339x2+20x,subjecttox5x0 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