Ex3. Heap \& Heapsort (important) Figure 1: an example of the heap. a) Please draw an array representation of the heap in Figure 1. b) Please draw the heap after inserting 28 into the heap in Figure 1. c) Please draw the heap after deleting the minimum element in the heap in Figure 1. Ex3. Heap \& Heapsort (important) d) Please print the heap in Figure 1 in preorder, inorder, and postorder. e) If you are required to sort data, 421,31,16,32, 66, 67, by only calling the routines in binheap.h/c in \ Code-c2e_all_ch on ftp, please write the main function. f) Assume that we use an array to store a heap. If you are required to sort the heap in Figure 1 without using any extra space to store the sorted elements, please explain your idea by drawing the heap and the array after deleting the minimum element, 4 , in the heap in Figure 1