Q3) Trace the action of the heap sort algorithm, implemented on an array, on the following sequence of keys: 23 34 3 20 32 46 43 7 a) Show the contents of the initial heap, and b) Draw the corresponding array contents after each deleteMax of the algorithm. a) Initial maxheap built from the given numbers: (draw it as an array) b) Array contents after each deleteMax The array after deleteMax: The array after 2d deleteMax: The array after 3 deleteMax: The array after 4h deleteMax: The array after h deleteMax: The array after 6h deleteMax: The array after 7h deleteMax