Assume you're going to Bucharest from Arad. Using Greedy Best$-$First

Search:

a$)$ Find the solution bath. $($Enter the path in the $"$X$,$ Y$,...,$ Z$"$ format$)$

b$)$ What's the path cost? $($Enter the number only$)$

c$)$ Is it optimal? $($Yes$/$No$)$