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