BINARY HEAPS

4. [15 points] Binary Heaps [10 points] Show the result of inserting 47, 99, 25, 21, 6,81, 19, 37,20, and 2, one at a time, into an initially empty minimum binary heap. Show the tree after each inserted item. a. b. [5 points] Show the layout of the heap elements represented by an array