Problem $3.$ Give an example of a simple, undirected, weighted graph such that a breadth$-$first traversal outputs

a search$-$tree that is not a single source shortest path tree. $($That is$,$ BFS is not sufficiently powerful to solve

the shortest$-$path problem on weighted graphs. This motivates Dijkstra$$s algorithm, which will be discussed in

the near future.$)$