What is the time complexity of Merge Sort for $n$ elements?

$O(n^2)$

$O(n)$

$O(logn)$

$O(nlogn)$