1)Suppose you label each node v of a binary tree T with a key equal to the preorder rank of v. Under what circumstances is T a heap?

2)Show the output from the following sequence of priority queue ADT operations. The entries are key-elements pairs, where sorting is based on the key value:

insert(5, A) insert(4, B) insert(7, I) insert(1, D) removeMin() insert(3, J) insert(6, C) removeMin() removeMin() insert(8, G) removeMin(), insert(2, H) removeMin() removeMin()