$(1)$ Show the result of inserting $2,10,15,8,12$ and $4$ into an initially empty max heaps $(2)$ Show the

result after deleting the maximum item $15$ from the heap. $($c$)$ What is the time complexity of adding an

element to a max heap and deleting an element from a max heap?