4. Create the binary heap (a max heap) from the following list of numbers (input from left-to-right). Make sure to show all intermediate steps. 2 3 4 5 6 7 1 8 9 10

Question Give the sequence of the 13 keys in the array that results after inserting the sequence of 3 keys 75 31 40 into the following maximum-oriented binary heap of size 10: 93 82 77 16 59 20 69 11 13 41 Answer Your answer should be a sequence of 13 integers, separated by whitespace.

Consider implementing heaps by using arrays, which one of the following array represents a heap? O a. [30,26,12,23,10,8] O b. [8,12,13,14,11,16] O. [30,26,12,13,10,18] O d. [18,12,13,10,11,16] Which of the following is wrong, after each iteration of quick sorting? a. None of the other answers O b. Elements in one specific (e.g. left) portion are smaller than the selected pivot. C. Elements in one specific (e.g. right) portion are larger than the selected pivot. O d. The selected pivot is already in the right position in the final sorting order.

(b) Now consider storing a heap as a linked list with pointers. Give pseudo-code on how you would store a heap node, and which modifications you need to make to the heap routines that we discussed in class. What are the runtimes of the heap routines?

We must perform reheapification when inserting an entry into a binary heap. What is the purpose of this process, and how complicated is it?