Need Help Please

Exanple Task: Find a path from Arad to Bucharest Straight-line distance to Bucharest Arad Bucharest Craiova Dobreta Eforie Fagaras Giurgiu Hirsova Iasi Lugoj Mehadia Neamt Oradea Pitesti Rimnicu Vilcea193 Sibiu Timisoara Urziceni Oradea Neamt 366 0 160 242 161 178 Zerind 151 87 75 lasi Arad 140 92 Sibiu 99 Fagaras 118 151 226 244 241 234 380 98 Vaslui 80 Rimnicu Vilcea Timisoara 142 Lugoj Pitesti21 97 70 98 Hirsova 85 Mehadia 146 101 Urziceni 253 329 80 199 374 86 75 138 Bucharest Dobreta 120 90 Craiova Eforie Vaslui Giurgiu Zerind 6 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 Iasi (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