Show that a DFS of an undirected graph G can be used to identify the connected component of G, and that the DFS contains as many trees as G has connected components. More precisely, show how to modify DFS so that each vertex v is assigned an integer label c] between to k, where k is te number of connected components of G, such that cefu-cel if and only if u and v are in the same connected component