Heap-Sort . Run the HEAP-Sort Algorithm on the array below and count up the total number of exchanges.

A = 24, 13, 23, 1, 5, 7, 12, 14

Write down the array after each key exchange.

Write down the total number of key exchanges.

No need to illustrate all of your steps.

Note: No of exchange is the number of times that you swap the position of two keys (Values of the array) until it is a sorted array.