2. Heuristic Search (10 points) Consider the problem of applying the tree version of greedy best-first search to the Romanian map we used in class using the straight-line distance heuristic. Note that this heuristic fails to find a path from lasi to Fagaras. However, the heuristic is perfect on the opposite problem: going from Fagaras to lasi. (a) Are there problems for which the heuristic fails to find a path in both directions? (Yes/No: (b) If Yes, explain your solution via a specific example; if No, explain why not