Suppose we want to store the data of a binary heap in an array. Show the data of that array after inserting the given keys one by one. Assume that initially binary heap is empty. Show all steps of insertions. 

Note: No need to show the changes for each step of percolate up. The contents of the array must be shown after completing one insertion.

Create the Min Heap for the following data set

7, 3, 18, -9, 1, 50, 15, 4, 27, 0