The worst$-$case time complexity of deleting an item from an unsorted li$$t $($assuming we have the item's position in the list$)$ is

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

$O(n^2)$

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

$O(n)$

$O(1)$