The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity.

• A. A
• B. B
• C. C
• D. D