Question $1($Graph traversals$)$

$(10$ points$)$ Draw an undirected and connected graph with five vertices such that the breadth$-$first traversal and the depth$-$first traversal algorithms give

exactly the same vertex order when the same starting vertex is selected. That should be true for any selected vertex in the graph. You may assume that for

any vertex, adjacent vertices are selected in ascending order.