Consider a rooted, connected graph G = (V, E), and a vertex u element of V. Let TB be a BFS tree of G rooted at u, and let TD be a DFS tree of G rooted at u. Prove that if TB = TD, then G is a tree