a question in algorithm

57 32 1 5 a Sketch the complete binary array represented by this array. Does this array form a heap? Explain why or why not. If not, rearrange the values in the array to form a heap using the makeHeapFast algorithm discussed in class. b. c. Show the result of inserting 35 into the heap from part (b). d. Now show the result of removing the maximum value from this heap. o-code for the heap sort algorithm. If necessary or desirable, you may use above as part of your D a call to the makeHeapFast algorithm mentioned above as part of your pseudo-code. Discuss the time complexity and space requirements of heap sort in the best, worst,and average cases. Compare this to the time complexities and space requirements of merge sort and quick sort. Describe a situation in which you might prefer heap sort to either other two algorithms. . 57 32 1 5 a Sketch the complete binary array represented by this array. Does this array form a heap? Explain why or why not. If not, rearrange the values in the array to form a heap using the makeHeapFast algorithm discussed in class. b. c. Show the result of inserting 35 into the heap from part (b). d. Now show the result of removing the maximum value from this heap. o-code for the heap sort algorithm. If necessary or desirable, you may use above as part of your D a call to the makeHeapFast algorithm mentioned above as part of your pseudo-code. Discuss the time complexity and space requirements of heap sort in the best, worst,and average cases. Compare this to the time complexities and space requirements of merge sort and quick sort. Describe a situation in which you might prefer heap sort to either other two algorithms