Heaps(a) insert the values 8, 12, 14, 11, 9, 16, 10, 7, 6 into an initially empty binary min heap. show the heap after each insertion as an array or as a tree. you do not need to show each individual percolation step.(b) show the result of using the linear-time buildheap algorithm on the same input.(c) perform three deletemin operations on the final heap from part (a). show the heap after each deletemin as a tree or array.