sIn Hill Climbing, what happens if no neighboring state has a higher value than the

current state?

a$.$ The algorithm backtracks to the previous state and explores alternative

paths.

b$.$ The algorithm moves to the highest$-$valued neighboring state found so

far.

c$.$ The algorithm terminates, considering the current state as the optimal

solution.

d$.$ The algorithm moves to a random neighboring state.