What's the big oh for a linked$-$list$-$based queue push operation, when the queue maintains both a head and a tail pointer?

Group of answer choices

O$($n$-$squared$)$

O$($log n$)$

O$(1)$

O$($n log n$)$