Imagine a situation where greedy best-first search will not find an optimal solution. Draw an example (such as a maze) and think about why A* search would not make the same mistakes.