9. Consider radix sort of a list of positive integers, with each decimal digit as a key. Assume that we proceed in a least-significant-digit-first manner, and we want to sort the list from small to large. Let the initial list of integers be

312, 256, 19, 713, 44, 608, 210, 909

(A) After the first pass, only one of the first four numbers in the list is less than 200. (B) The last number in the list after the second pass is 256. (C) 44 is among the last four numbers of the list after the second pass. (D) It is possible to have radix sort run with linear time complexity with respect to the length of the list to be sorted.