Define admissible heuristic with an example. Explain the working mechanism and limitations of hill climbing search.

--- An admissible heuristic is a heuristic function h(n) that never overestimates the true cost of reaching the goal from node n. In other words, for every node n: h(n) <= h(n) where h(n) is the actual (true) cost from node n to the goal. An admissible heuristic is always optimistic - it either c...