The performance of the merge operation for n items in merge sort is

Question $4$ options:

O$($n$2)$

O$($log n$)$

O$($n log n$)$

O$($n$)$