Problem $2.$ Give an example of a simple, undirected, and unweighted graph G$($V$,$ E$)$ that has a single source

shortest path tree which a breadth$-$first traversal will NOT return for any ordering of its vertices. Your answer

must