Worst case complexity of Breadth First Search traversal __________

• A. O(n*n)
• B. O(nlogn)
• C. O(n2 logn)
• D. O(n3)