Question $19$

For a list of length $n,$ insertion sort makes key comparisons, in the worst case.

$O(n^2)$

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

None of the other answer choices is correct

$O(n)$

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