The worst$-$case time complexity of inserting an item in a sorted list is $($assume non$-$linked list$)$

$O(n^2)$

$O(nlog2n)$

$O(n)$

O$(1)$

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