Please Help with part C

I need the part C answer if you are not going to answer part C please skip and don's answer the hall question because the answer of A and B is already available on Chegg 14.3-7. Consider the following nonconvex programming problem. Maximize f(x)=x-60x + 900x + 100, 0x 31. need help for this question (a) Use the first and second derivatives of f(x) to determine the critical points (along with the end points of the feasible region) where x is either a local maximum or a local minimum. (b) Roughly plot the graph of f(x) by hand over the feasible region. (c) Using x = 15.5 as the initial trial solution, perform the first iteration of the basic simulated annealing algorithm pre- sented in Sec. 14.3 by hand. Follow the instructions given at the beginning of the Problems section to obtain the needed random numbers. Show your work, including the use of the random numbers. subject to