$(10$ pts$)$ Draw the state space generated by the following algorithm. You can use the first

letter of the city in your state space. Associate a path cost with each node you expand. Use

graph$-$search algorithm $($as described in the book$)$ with $A^{**}$ to find the path from Lugoj to

Bucharest. You need to show the search tree with the corresponding cost for each node.