What is the time complexity of inserting a node at the end of a doubly linked list with n elements?

Group of answer choices

O$($n log n$)$

O$($log n$)$

O$(1)$

O$($n$)$