The question is related to data structure implement & analysis (C++)

The answer should assume HeapSort uses a max-heap when solving the problem.

2. Describe an array of size n = 32 such that if it is the initial input to HeapSort in the order presented, no other permutation of the input will cause the algorithm to use more comparisons to sort the array. Explain why it does this. You do not and should not) write out the entire array, but rather describe the order. You may wish to split your explanation for why so many comparisons happen into phases (heapify and then extract-Min phases)