L.1 (10 points) Show how an initially empty binary heap would look like after inserting 10, 12, 1, 14,6 5, 8, 15, 3, 9,7,4, 11, 13 and 2 one at a time 1.2 (10 points) Show the result of using the linear-time algorithm to build a binary heap using the same input