If the heuristic function h is consistent, then A* search with f(n) = g(n) + h(n) is optimal. Hint: Let's say, for a node n, the shortest path to the goal is through a successor called m. Since, the heuristic is consistent, h(n)