The complexity of Merge Sort algorithm is

I. O$($n$)$

II$.$ O$($log n $)$

III. O$($n$^2)$

IV$.$ O$($n log n$)$

V$.$ None of the above