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

$O(1)$

$O(logn)$

$O(nlogn)$

$O(n)$