$1.$ Suppose we are given an array of keys $10,12,1,14,6,5,8,15,3,9,7,4,11,13,$ and $2.$ We want to build a min$-$heap $.($a$)(15$ points$)$ Show the result of inserting the keys $($in the order given$)$ into an initially empty binary heap. Give your answer as an array. $($b$)(15$ points$)$ Show the result of calling BuildHeap on the array of keys to build the binary heap. Give your answer as an array