Question $1.$ Draw the binary tree produced by inserting the following elements in the max$-$heap in the given order.

$6,11,4,3,7,15,9,12,16$

Insert each element, one at a time, and show the leap after each insertion. List the elements of the array which represents the heap in the problem.