given an array of integers, do the following. [0, 11, 20, 26, 22, 0, 13, 14, 28, 26, 3, 27]

(c 7 pts) Transform the max heap of (a) to a binary search tree. (d - 8 pts) For the binary search tree obtained in (c), determine the average number of comparisons for a successful search and the average number of comparisons for an unsuccessful search. (e - 8 pts) Use the sorted array of (b) to construct a binary search tree.