E11.1. Given the following sequence of integers: 12, 19, 10, 4, 23, 7, 45, 8, 15 (a) Build a max-heap by inserting the above set in the given sequence. Show the (b) On the heap constructed above, perform successive deletenax operations. Show heap after every insertion. How many comparisons in all did it take to build the heap? the heap after every delete max. How many comparisons did it take in all to delete all the entries from the heap