5.) Draw the heap that results from inserting the same values as on the first page into an initially empty min ordered heap. 50, 75, 25, 40, 10, 90, 60, 80, 30, 70, 20

6.) Perform two extract-min operations on the heap above. Draw the heap after each operation.

7.) Draw the min-ordered heap that results from using the bottom-up heap building method. Start with an initial array containing the values: 50, 75, 25, 40, 10, 90, 60, 80, 30, 70, 20.