Heaps Starting with the min-heap H in the figure below, the following operations are applied successively to the heap. Show the contents of the heap (.e. draw a tree representation of it) after each step. Insert 14; change 13 to 4; insert 6; delete minimum