The worst$-$case time complexity to merge two sorted lists of size $n$ is $($using the most efficient algorithm$)$

$O(n)$

$O(n^2)$

$O(lo{g}_{2}n)$

$O(nlo{g}_{2}n)$