For a sequentially stored linear list of length $$N$$, the time

For a sequentially stored linear list of length $$N$$, the time complexities for deleting the last element and inserting the first element are $$O(1)$$ and $$O(N)$$, respectively. ~@[](1)

答案：TRUE