Given the following integer elements: 30, 65, 22, 40, 15, 70, 80, 60, 55, 10 For a and b Show all intermediate steps for full credit. You do not need to show the array representation of the heap.

a. Draw the tree representation of the heap that results when all of the above elements are added (in the given order) to an initially empty maximum binary heap. Circle the final tree that results from performing the additions.

b. After adding all the elements, perform 2 removes on the heap. Circle the tree that results after the two elements are removed.