Time Complexity of an Insertion

Consider a linked list of $n$ elements. What is the time taken to insert an element at a position that is pointed to by some pointer?

Pick ONE option

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

$0(n)$

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

Clear Selection