Given the following sequence of integers12, 19, 10, 4, 23, 7, 45, 8, 15a) Build a max-heap by inserting the above set in the given sequence. Show the heap after every insertion. How many comparisons in all did it take to build the heap?b) On the heap constructed in part (a), perform successive delete_max operations. Show the heap after every delete_max. How many comparisons did it take in all to delete all the entries from the heap?c) The above two steps essentially sort a set of entries, The total number of comparisons for both steps is the number of comparisons required to sort the set. Compare this with the selection sort algorithm, which was discussed in the context of the quadratic running time order. How man comparisons does selection sort make on the above set?