a. Draw the binary min heap represented by the following array: 7 3 12 4 29 6 14 Index o 2 17 16 4 b. Show the result of calling deleteMin twice on the heap you drew in part (a). Show the heap after each deleteMin, and circle the final heap. Starting with the heap you ended up with in part (b), insert values 11 & 2 in that order. Draw the heap after each insertion, and circle the final heap. c