iven the following sorted vector of integers:           // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13vector v {-23, -5, 9, 14, 15, 18, 23, 24, 25, 27, 34, 62, 85, 87};   What indexes are examined in a search for each value, and what value is returned?   sequential search for 27 A examines 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13; returns 9 B examines 0, 1, 2, 3, 4, 5, 6, 7, 8, 9; returns 27 C examines 0, 1, 2, 3, 4, 5, 6, 7, 8, 9; returns 9 D examines 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13; returns 27 E examines 13, 12, 11, 10, 9; returns 9 (order shuffled) binary search for 27 A examines 6, 8, 10; returns 9 B examines 6, 10, 8, 9; returns 9 C examines 6, 9; returns 9 D examines 6, 3, 1; returns -1 E examines 7, 10, 9; returns 9 (order shuffled)

Heapsort has heapified an array to: 91 41 13 34 63 55 and is about to start the second for loop. What is the array after the first iteration of the second for loop? Ex: 98, 36, 41

please find:           indexes examined      and        value returned

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