What is the Big$-$O of this Linked List method in the worst case?

addLast$($entry$)$

Question $3$ options:

O$(1)$

O$($n$)$

O$($n log n$)$

O$($log n$)$