Question $2.$ Informed Search.

Figure $2$: A map of Romania

Figure $3$: A table of straight$-$line distances from each city to Bucharest

$(1)$ Implement Greedy Best$-$First Search and $A^{**}$ Search algorithms to find the optimal

route from Oradea to Bucharest on a map of Romania.

$(2)$ Record and compare their effectiveness and efficiency in terms of path length and

number of nodes visited.

$(3)$ Coding the Greedy Best$-$First Search and $A^{**}$ algorithms. You can choose to complete

the code in appendix, or complete it completely on your own.