braw the binary min heap that results from inserting 8, 7, 3, 2, 4, 6, 9, 5, 1 in that order into an initially empty binary min hea p. Show final tree and the array representation of the heap. No need to show the intermediate work. 0 5 6 8 10 12 9. Consi der the binary heap shown below. What would the heap look like after deleteMin operation is performed? Show your work. 13 28 44 61 60 68 55 b. 28 1 3 28 60 44 61 60 68 65 61 65 68 35 71 70 63 65 71 70 63 71 7063 28 60 44 61 63 68 55 60 44 61 63 68 55 71 70 65 71 70 65