Draw an array-based representation of the following min-heap and then draw a tree-based representation of the heap and mark all paths where any swaps occur after each (you should have five drawings) of the steps below: heap.removeMin(): heap.removeMin(): heap.insert(3): heap.removeMin(): heap.insert(7)