Describe how to alter the depth-first search so that every vertex v is allocated an integer label cc[v] between 1 and k, where k refers to the number of connected components of G, such that cc[u] = cc[v] if and only if u and v lies in the same connected component.