Draw the search tree generated by applying A$*$ and graph$-$search to find a path from L $($Lugoj$)$ to B $($Bucharest$)$ using the straight$-$line distance heuristic. Show the f$-$cost f$($n$)$ for each node.