Each student has their own array. Im number 27!

Question 1: construct a max heap array.(show how you transformed from binary tree to max heap).

Question 2: transform max heap to a min heap using a sequence of reheapify operations.

Question 3: sort min heap version (from Question 2) in order to obtain an array of reversely sorted integers.

Question 4: transform the max heap to binary tree. Show all step!

Question 5: transform the binary tre to a min heap. Show all steps!

Question 6: differentiate between binary trees/min heaps of question 2 and question 5 with respect to the nature of data distribution in left sub tree and right sub tree of each internal node.

Question 7: consider the binary tree in question 4. Delete the root node of this binary search tree and do the necessary transformation to get a new binary search tree.