We have already discussed an O(n) algorithm for Heapify inclass. Argue that this algorithm is asymptotically optimal; thatis, Heapify has a problem complexity of Ω(n). Make your argument inthe context of a minheap (a similar argument should work for a maxheap).
Hint: you do not need a problem reduction for this argument;Ω(n) is a trivial lower bound.
Answer