4. We have a connected graph G=(V,E), and a specific vertex uV. Suppose we compute a depth-first search tree rooted at u, and obtain a tree T that includes all nodes of G. Suppose we then compute a breadthfirst search tree rooted at u, and obtain the same tree T. Prove by contradiction that G has the same structure as T, that is, G cannot contain any edges that do not belong to T