Which statement about Big-O Notation is correct?

A. push and pop occur at the same end B. it may examine every element C. constant factors and lower-order terms are ignored asymptotically D. it typically uses recursion or a stack