What is a major limitation of the basic hill climbing search algorithm?

Select one:

It can get stuck at local maxima, local minima, or plateaus.

It is computationally very expensive.

It requires a complete knowledge of the search space.

It guarantees finding a solution if one exists.

It evaluates every possible move before proceeding.