Problem $3$: Search Trees $(4$ pts$.)$

Consider the simplified road map of Romania found in Figure $3\mathrm{.}2.$ Substitute the first letter of the city name to represent each node $($e$.$g$.,$A$$ for $$Arad$).$

a$)$ Suppose you are at Sibiu. Draw the search tree, limited to depth $4,$ that would be generated using an explored set. Expand nodes counter$-$clockwise starting from the Western$-$most neighbor, placing the expanded nodes in the search tree from left to right. How many nodes are in the tree?