What is the computational complexity of deleting an element, e from a doubly linked list with tail in the worst case in terms of Big O notation? Assume the list has $n$ items.

O$($logn$)$

$O(1)$

$O(n)$

$O(n^{{?}^{{?}^{?}}}2)$