24. For sorting n integers, which of the following statements is true? (A) Both quick sort and merge sort have O(nlogn) worst-case time complexity. (B) Both quick sort and merge sort are stable sorting algorithms. (C) Both quick sort and merge sort do not need extra space. (D) Heap sort achieves O(nlogn) average-case time complexity. (E) Heap sort needs extra space during sorting.