sWhich characteristic distinguishes Simulated Annealing from other Local Search

algorithms?

a$.$ It guarantees to find the global optimum.

b$.$ It explores the entire search space exhaustively.

c$.$ It always moves to a neighboring state with a higher value.

d$.$ It uses temperature parameter to control the probability of accepting

worse solutions.