Given an array of integers, do the following:

[11,

0,

20,

26,

22,

0,

13,

14,

28,

26,

3,

27]

(Q1 - 15 pts) Construct a max heap of the array. Show the initial essentially complete binary tree and the transformation of the binary tree to a max heap via the reheapify operations at the indices of the internal nodes (as shown in the slides.

(Q2 - 10 pts) Transform the max heap to a min heap (via direct transformation) using a sequence of reheapify operations.

(Q3 - 15 pts) Sort the min heap version (obtained from Q2) of the array (step by step) in order to obtain an array of reversely sorted integers.