Which of the following is a true statement regarding Quick Sort?

A. It requires O(n)extra space.

B. It has a lower time complexity than Heap Sort.

C. On both average-case and worst-case scenarios, it has a time complexity of O(nlg n).

D. Its worst-case time complexity is still O(nlg n)f the partitioning always produces two sublists whose sizes have a constant ratio r (and r < 1).

E. None.