The elements in a binary tree are stored in an array. Each element is a nonnegative int value. Write an array for the given tree. If given tree is not a heap, then first make it heap by adding dummy value. Show tree after adding dummy nodes. ● ● Use -1 as a dummy value Clearly show in drawing where you inserted dummy nodes Show indices in final array 33 22 13 44 11 20 25

Create three problem instances of size n is around 10, representing the best-case, worst-case and average-case for Radix Sort respectively. Show how the Radix Sort works on the best-case, and explain why each of them represents the best-case, worst-case and average-case respectively.   psudocode for Radixsort attached

Heapsort has heapified an array to: 98 71 63 38 16 and is about to start the second for loop. What is the array after each loop iteration? i = 4: Ex: 86, 75, 30 i = 3: i = 2: i = 1: