Select the tightest asymptotic bound.

What is the running time of

removeLast on a singly

linked list?

What is the running time of

addLast on a doubly

linked list?

What is the running time of

addLast on a singly linked

list?

What is the running time of

removelast on a doubly

$O(1)$

$O(logn)$

linked list?