Problem 2: heaps.

min-heap: construct a min_heap from the following set of integers. remember to use successive adds to arrive at your final heap. (you do not need to show all the intermediate steps, however, showing those can in case you make an error somewhere down the line.)

1, 19, 7, 5, 6, 42, 21, 13, 56, 78, 29, 3, 14

remove_min: show the result of two successive remove_min operations on the heap formed in part a.
perform the following operations on the min_heap: add(45)

as you must have noticed the set of integers provided to both the bst and heap problems were the same. however, the structures formed are vastly different. what can you say about the relative heights (and therefore the worst-case cost of operations) of the bst as compared to the heap? what conclusions are you able to draw regarding the relative efficiency of the 2 data structures? (remember that log213 = 3.7)