Which statement about Counting Sort is correct?

A. both front and rear operations can be efficient B. it is commonly implemented using a hash map plus a doubly linked list C. its running time depends on both item count and key range D. each digit pass must use a stable subroutine in common LSD implementations