The answer is given. Please show steps.

Given the following sequence of numbers, 2, 4, 1, 3, 5, 7, you are to insert the six elements (in the given order) to an initially empty max-heap. Show the resulting max heaps for the first n numbers in this sequence for n 1,2,.,6 2 4, 2 4, 2, 1 4, 3, 1, 2 5, 4, 1, 2, 3 7, 4, 5, 2, 3, 1 Grading: 1 pt each until the first mistake