Q3. (40 Points) Solve question 6.2 (both a and b) at page 283 in your textbook. For this question, show your solution step by step as shown in your textbook. Draw all intermediate trees to build up the heap. 6.2 a. Show the result of inserting 10, 12, 1, 14, 6, 5, 8, 15, 3, 9, 7, 4, 11, 13, and 2, one at a time, into an initially empty binary heap. b. Show the result of using the linear-time algorithm to build a binary heap using the same input.