3. Assume we build a binary max-on-top heap from keys 10, 12, 1, 14, 6, 5, 8, 15, 3, 9, 7, 4, , 13, 2. Show the result of building this heap by inserting the above keys one at a time in the order given (from left to right), into an initially empty binary heap. Please show key steps and short illustrations if necessary. (10 pts) Show the heap from problem (a) above after executing three deleteMaximum operations on this heap. Show each step. (10 pts) a. b