#####PLEASE WRITE ON PAPER BY HAND ####### Q$3.$ While applying a simulated annealing algorithm to a certain problem, you have come to an iteration where the current value of $T$ is $T=2$ and the value of the objective function for the current trial solution is $30.$ This trial solution has four immediate neighbors and their objective function values are $29,34,31,$ and $24.$ For each of these four immediate neighbors in turn, you wish to determine the probability that the move selection rule would accept this immediate neighbor if it is randomly selected to become the current candidate to be the next trial solution. Determine this probability for each of the immediate neighbors when the objective is maximization of the objective function.