Warning: The hard deadline has passed. You can attempt it, but you will not get credit for it. You are welcome to try it as a learning exercise.
To specify an array or sequence of values in an answer, separate the values inthe sequence by whitespace. For example, if the question asks for the firstten powers of two (starting at 1), then the following answer is acceptable: 1 2 4 8 16 32 64 128 256 512If you wish to discuss a particular question and answer in the forums, pleasepost the entire question and answer, including the seed (which can be used bythe course staff to uniquely identify the question) and the explanation (whichcontains the correct answer).
(seed = 397433)Give the sequence of the keys in the array that results afterinserting the sequence of 3 keys 50 16 37 into the following maximum-oriented binary heap of size 10: 96 79 39 56 48 12 24 32 34 14 Your answer should be a sequence of 13 integers, separated by whitespace.
(seed = 924800)Give the sequence of keys in the array that results after performing 3successive delete-the-max operations on the following maximum-oriented binary heapof size 10: 78 76 75 72 53 64 73 43 66 14 Your answer should be a sequence of 7 integers, separated by whitespace.
(seed = 235174)Which of the following statements about priority queues are true? Check all that apply. Unless otherwise specified, assume that the binary heap implementation is the one from lecture (e.g., max-oriented and using 1-based indexing).
A programmer might prefer heapsort to mergesort because heapsort uses fewer compares in the worst case.
Let a[] be a binary heap that uses 0-based indexing (instead of 1-based indexing). Then, the parent of a[k] is a[floor(k/2)].
Let a[] be a binary heap that uses 0-based indexing (instead of 1-based indexing). Then, the parent of a[k] is a[floor(k/2) + 1].
In the best case, the number of compares to insert N distinct keys into an initially empty binary heap is linearithmic.
Let a[] be a binary heap that uses 0-based indexing (instead of 1-based indexing). Then, the parent of a[k] is a[floor((k-1)/2)].