(Choose 1 answer)
Select the most correct statement about the complexity of mergesort
A. Both best and worst cases are O(nlogn)
B. The best case is O(n), and the worst case is O(nlogn)
C. Best case is O(nlogn), the worst case is O(n^2)
D. The best case is O(n), and the worst case is O(n^2)
Exit 45
