Repeat Exercise 1, this time with a maxheap.Exercise 1Starting with the tree resulting fro...

Repeat Exercise 1, this time with a maxheap.

Exercise 1

Starting with the tree resulting from Exercise 2 draw the heap that results from performing a removeMin operation.

Exercise 2

Draw the heap that results from adding the following integers.

34 45 3 87 65 32 1 12 17

addElement(40);

addElement(25):

removeMin();

addElement(10);

removeMin();

addElement(5);

addElement(1);

removeMin();

addElement(45);

addElement(50);