Heaps are a data structure for implementing Priority Queues.

Consider an empty binary heap H initialized to hold at least 7 elements.

A) Draw the tree structure of H after the following operations are called in the order given: Insert(H,2); Insert(H,4); Insert(H,5); Insert(H,11); Insert(H,5); Insert(H,9); Insert(H,3).

B) Now draw the resulting tree structure of the above heap, H, after ExtractMin(H) is called.