What is the Big$-$O time complexity for an algorithm to display the nth integer in a linked chain of integers?

Question $11$Select one:

a$.$

O$($k$)$

b$.$

None

c$.$

O$($n$)$

d$.$

O$(1)$

e$.$

O$($kn$)$