7. Let G = (V. E) be a connected, undirected graph, and suppose T= (V, F) is a tree on G created by exploring G using depth-first search starting from vertex s. Vertex s is the root of tree Ts. Argue that s has more than one child in T, if and only if removing s from G breaks G into several disconnected parts