1) show the result of inserting the following values one at a time into an initially empty binary heap. (show the heap after the insert).
use trees to illustrate each heap. 42,11,28,8,13,61,18
2) show how to the final heap created in the previous problem would be stored in an array.