Given a linked list implementation, deleting the element at arbitrary position i takes how long in the average case?

$(logn)$ time

$(n)$ time

$($nlogn$)$time

$($i$)$time

$(1)$time