To show that an n-element heap has height [lg n].

In a min-heap, the next largest element of any element can be found in O(log n) time. True False

Python code please thank you!!

Suppose we have an ArrayHeap that uses the array representation from class (also called "tree representation 3B" in lecture). Recall that in this representation that the leftmost item is unused. Consider a heap with the following underlying array: | •| | 2|•| • | •| | -8 5 1 10 | 10 | 12 --- Suppose we are using our heap to represent a priority queue. If we call removeSmallest on the heap above, where will the 12 end up after removeSmallest has completed execution? Assume removeSmallest works as described in the lecture. By "completed execution", we mean the entire operation is done and the array again obeys our heap properties. O 12 will not move. O 12 will not be present in the heap. O In the root position previously occupied by a -8. O In a position previously occupied by a 5. O In a position previously occupied by a -2. O In a position previously occupied by a 9. O In a position previously occupied by a 8. O In a position previously occupied by a 0. O In a position previously…