What would be the time complexity of the BFS traversal of a graph with n vertices and n1.25 edges?

• A. O(n)
• B. O(n1.25)
• C. O(n2.25)
• D. O(n*n)