For a linked$-$chain implementation of a stack, what is the expected run$-$time for obtaining the top of the stack?

Group of answer choices

O$(1)$

O$($n$)$

O$($n$+$n$)$

O$($n$^2)$