Suppose we create a Max Heap by inserting 6,12,7,10,17,5,15 in order into an initially empty heap, give both the tree and array representations of the final heap. All intermediate heaps are NOT required. However, you may show each major insertion (i. e., draw one tree after each insertion) for partial credit.