2. (10 marks) Consider our binary tree HEAP data structure. Recall that it supports INSERT and EX- TRACT-MAX in O(log n) worst case time, where n is the number of elements in the PRIORITY QUEUE (c) Consider a sequence of n EXTRACT_MAX operations performed on a heap H that initially contains n elements. Does the fact that the amortized cost of each EXTRACTMAX operation is O(I) mean that the entire sequence can be processed in O(n) time? Justify your