Consider a recursive implementation of Merge Sort which is used to sort an array of size n. The number of recursive calls made to Merge Sort is: (Select ONE answer)
A. O(n) but not Theta(n)
B. Theta(n)
C. O(n log n) but not Theta(n log n)
D. Theta(n log n)