Answer and explain this question in details from Algorithm Design and Analysis class. Thanks

(i) Find the number of connected components of an undirected graph that has m (ii) What is the time complexity (using big O-notation) for finding the connected ii Find the number of connected components of an undirected graph that has n nodes and one edge. components in Question 5(i)? nodes and n(n-1)/2 -1 edges, where n>2