In a linked$-$based implementation of the ListInterface with a head reference and tail reference $($firstNode and lastNode$),$ what is the time complexity of removing an entry at the end of the list?

Group of answer choices

O$(1)$

O$($logn$)$

O$($n$)$

O$($n$2)$

depends on the size of the list

Flag question: Question $22$