$2.[5$ pts$]$: Consider the following graph. Do an Iterative Deepening Depth First Search on this graph, where the depth bound is not measured in terms of number of edges $($as in the inclass exercises$)$ but in terms of the total distance to the nearest goal node.

Start with a depth bound of $3,$ and increment the depth bound by $3$ each time through. If you could choose either of two nodes to visit next, break ties alphabetically. Appendix A shows an example of doing this for a different graph. Please give your results in the form that I give in the appendix.

Solution: