Need D,E,F,G,H, and I
using the array [12,27,0,16,6,23,28,16,3,13,29,26]
(a – 15 pts) Construct a max heap of the array. Show the initialessentially complete binary tree and the transformation of thebinary tree to a max heap via the reheapify operations at theindices of the internal nodes (as shown in the slides).
(b – 15 pts) Sort the max heap version of the array obtainedfrom (a) to obtain a sorted array of integers. Show the structuralchanges in the max heap in each iteration.
(c – 7 pts) Transform the max heap of (a) to a binary searchtree.
(d – 8 pts) For the binary search tree obtained
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured