Question

What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
(a) O(1)
(b) O(n)
(c) θ(n)
(d) θ(1)