Which statement about Hash Table is correct?

A. it performs a linear scan to choose each next position B. very deep recursion can cause stack overflow C. collisions must be handled when keys map to the same position D. it may examine every element