What is the worst case time complexity for Merge sort?

O$($n$)$

O$($n$^2)$

O$($log n$)$

O$($n log n$)$