What is the Big$-$O advantage of the merge sort algorithm?

The merge sort even in the worst case has a Big$-$O of O$($n log n$)$

The merge sort has a Big$-$O of O$($n$)$

The merge sort is much more memory efficient than the quick sort

The merge sort chooses a pivot element more efficiently