Consider a maximization problem that is being solved by Simulated Annealing. Let the objective function value of the current state be 100. Let this state have 5 successors/neighbors: s1(95), s2(97), s3(99), s4(102), and s5(105). The numbers in parentheses represent the corresponding objective function values. The current temperature is 100. Pick the statement that best describes what happens in the next iteration of the Simulated Annealing algorithm. Select one:
a. 51(95) is more likely than s2(97) to be the next state
b. s4(102) and s5(105) are equally likely to be the next state
c. 51(95) is most likely to be the next state
d. s5(105) is most likely to be the next state