Draw the binary tree produced by inserting the following elements in a max-heap in the given order 10, 18, 27, 14, 3, 5, 15, 20, 28 Insert each element, one at a time, and show the heap after each insertion. Once you have inserted the elements into the max-heap, list them in the order they appear in the array representation of the heap