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

Group of answer choices

O$($logn$)$

O$($n logn$)$

O$($n$)$

O$($n$^2)-$ n raised to the power $2$