Merge Sort has an worst case run time of:

$6$

$O(n^3)$

$9$

$O(n)$

$O(n^{**}lg(n))$

$12$

$O(n^2)$