Which statement about Radix Sort is correct?

A. it reuses blocks instead of requesting each one separately from the system B. it can support pattern search in time proportional to the pattern length C. each digit pass must use a stable subroutine in common LSD implementations D. collisions must be handled when keys map to the same position