Pseudo$-$code for the Simulated$-$Annealing algorithm is given below; note that in the version

of the algorithm given, we wish to maximize the objective function $($i$.$e$.$ walk uphill$).$

$($i$)$ Describe the idea behind the Simulated$-$Annealing algorithm. Be sure to briefly explain the role

of each component in the algorithm.