What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?

What would be the asymptotic time complexity to insert an element at t

1.	What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?
A.	O(1)
B.	O(n)
C.	O(n<sup>2</sup>)
D.	O(n<sup>3</sup>)
Answer» B. O(n)