VII There is a linked-list with n elements, which arex₁,x₂,...,x_n. Let f(n) be the time complexity of inserting a new element Int: to the tail of the list, and g(n) be that of deleting the last element an. If there is only one pointer pointed to the head of the list, we kuow to access the list is time-consuming, and functions f(n) and g(n) are denoted as f₁(n) and g₁(n) in this case. 'To improve it, we may also add another pointer pointed to the tail of it, so the functions f(n) and g(n) become f₂(n) and g₂(n). Which of the following option is false if n becomes large.__ (13)__
(A)
(B)
(C)  
(D)