An undirected graph G with n vertices and e edges is shown by adjacency list. What is the time required to generate all the connected components?
O (e+n)