資料結構與演算法(A)

(5 points) There is a linked-list with $n$ elements $x_1, x_2, \dots, x_n$. Let $f(n)$ be the time complexity of inserting a new element $x_{n+1}$ to the tail of the list, and $g(n)$ be that of deleting the last element $x_n$. If there is only one pointer pointed to the head of the list, the functions are denoted $f_1(n), g_1(n)$. To improve it, we may also add another pointer pointed to the tail, so the functions become $f_2(n), g_2(n)$. Which of the following option is false if $n$ becomes large?