(Simulated Annealing) In the context of simulated annealing, assume that T is kept constant and let pxy be the probability that when the current solution is x, the next solution sampled is y. Consider the special case where pxy = pyx for all feasible solutions x and y, and assume that the Markov chain defined by the probabilities pxy is irreducible, in the sense that there is positive probability to go from any x to any y, with one or more samples. Show that the steady-state probability of a solution x is
