What is the running time of Mergesort when the input is an array where all record values are equal?
\Theta(n \log n)\Theta(n^2)\Theta(\log n)\Theta(n ^ n)\Theta(n)Does Mergesort's number of comparisons depend on the particular order of the input array?
No, it does not.