What is the Big$-$O performance of the merge function in the merge sort?

$*$

O$($n$)$

O$($log n$)$

O$($n$^2)$

O$(1)$