Give a linear time, depth-first-search algorithm to find the size of the largest connected component in a graph, where size is measured by the number of edges in the component.