Consider a recursive implementation of merge sort which is used to sort an array of size n. What is the number of recursive calls made to merge sort? Consider a recursive implementation of Merge Sort which is used to sort an array of size n. What is the number of recursive calls made to Merge Sort: O(n) but not Theta(n), Theta(n), O(n log n) but not Theta (n log n) or Theta?