Suppose you’re applying a simulated annealing algorithm to a certain problem, where T is the parameter that measures the tendency to accept the current candidate to be the next trial solution. You come to an iteration where the current value of T is T = 4, the value of the objective function for the current trial solution is 40, and the value of the objective function for the current candidate to be the next trial solution is 36. (a) Using the standard move selection rule, determine the probability of accepting this candidate to be the next trial solution when the objective is maximization of the objective function. (b) What is this probability when the objective is instead minimization of the objective function?