Quiz: QuickSelect

QuickSelect finds the $k$-th smallest element in expected $O(n)$ time. Why doesn't it need to fully sort?

1. A.After partition, it only recurses into the side containing $k$
2. B.It only works on sorted arrays
3. C.It uses a heap instead of comparisons
4. D.It uses counting sort internally