Consider an undirected graph G with n nodes. Suppose that the breadth-first search of G starting at node u and the depth-first search staring from the same node u result in the identical spanning tree T. Is is true that G itself is equal to T? If not, give a counter-example. If so, prove that it is the case