46. Regarding HEAPSORT, which of the following statements is WRONG？ (A)The worst execution time of HEAPSORT is Ω(n2 ) (B)The same as the previous item, but it is changed to sort in descending order first, then use HEAPSORT to sort the array and its execution time is Θ(nlogn) (C)There is an array of length n, which has been sorted in ascending order. When using HEAPSORT to sort this array, the execution time is Θ(nlogn) (D)When the elements in the array are not the same, the best execution time of HEAPSORT is Ω(nlogn)