Starting with an empty min heap, draw the tree after each of the following series of inserts and removals: insert(40); insert(25): insert(10); insert(5); insert(1); insert(45); insert(50); deleteMin()