Show a tree-style max binary heap and the contents of an underlying array after each of the following operations is executed. You can assume that the array has enough room for all elements without resizing. insert 7, insert 9, insert 1, insert 0, delMax, delMax, insert 5, insert 3, insert 2, insert 8, delMax, delMax