6. (2 points) The heapsort algorithm is not , but you can make it appear so by using aon items inserted into the heap. A. In-Place, Comparator B. Stable, Comparator C. Stable, Wrapper Wrapper E. None of the above. D. In-Place, Answer: 7. (4 points) What is the complexity of heapsort when sorting an array already in sorted order? A.w(1) B. (nlog(n)) C.O(n log(n)) D.O(2") . All of the above