$($b$)$ Both depth first search $($DFS$)$ and breath first search $($BFS$)$ can be

extended to depth first tree $($DFT$)$ and breath first tree $($BFT$)$ to

construct a spanning tree. Consider the following graph.