For a doubly$-$linked list, the time complexity of append$($item$),$ pop$(),$ and add$($item$)$ are:

Question $24$Select one:

O$(1),$ O$(1),$ and O$($ n $)$ respectively

all O$(1)$

all O$($ n $)$

O$($ n $),$ O$($ n $),$ and O$(1)$ respectively