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

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

答案：FALSE