The worst$-$case time complexity for insertion sort is

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

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

$O(n)$

$O(n^2)$