Which statement about Linear Search is correct?

A. it typically uses recursion or a stack B. only the root is guaranteed to contain the global minimum or maximum C. it may examine every element D. each digit pass must use a stable subroutine in common LSD implementations