What makes simulated annealing superior to greedy heuristics like gradient descent for some problems? a :All of the abov

[answerhappygod]

What makes simulated annealing superior to greedy heuristics
like gradient descent for some problems?
a :All of the above
b: It can avoid local minima or maxima
c: It is substantially faster
d: It is never superior.
e:It provides a guarantee of being no worse than twice the
optimal solution