2. Draw the final heap resulting from inserting the following number sequence into the heap in order from left to right: 10, 45, 87, 99 121, 75, 73, 74, 76, 1, 2 3. Heaps are priority queues, so draw the previous heap after performing its first poll) operation. 4. In a binary min-heap, identify: A series of five numbers producing the worst case timing for the data structure The complexity class O for inserting N items into the data structure using the worst case The complexity class O for inserting N items into the data structure using its best case permutation