Consider running Heapsort (A,n ) on an input array A (of size n ) with all the elements being the same, which of the following statements is correct? The number of key comparisons made by Heapsort (A,n) will always be (nlogn) The number of key comparisons made by Heapsort (A,n) will always be (n) The number of swaps made by Heapsort (A,n) will always be (nlogn). The number of swaps made by Heapsort (A,n) will always be (n)