(e) Consider an initially empty max-heap, where the following keys are to be inserted one at a time: 11, 19, 23, 12, 13, 17, 13, 14, 18, and 33. Draw the tree that results after building this max-heap.

(f) Is it possible to find the maximum in a min-heap in O(log n) time? Justify.

Important Notes:

For part (e) of this problem, you must draw the min (or max) heaps using the appropriate graphics tools at your convenience.