In the worst case, the total number of comparisons for Mergesort is closest to:
n \log n
n
n^2
n^2/2
What is the asymptotic cost of Mergesort?
Only one of these answers looks like the asymptotic cost.