Q$5)$

a$)(5p)$ What are the average case performances $($big$-$O$)$ for the following sequential sorting algorithms?

Selection Sort

Insertion Sort

Heap Sort

MergeSort

QuickSort

b$)(15$p$)$Perform a radix sort of the following list of numbers, using a radix of $10,$ into ascending order: $32959540815291466729014153210883107395663$

Show the bin$/$bucket sort conducted in each pass of the radix sort using the provided tables. You must also wr down the order of the numbers after each pass.

First Pass

$\backslash$table$[[,2,3,4,5,6,7,8,9]]$

Second Pass

$\backslash$table$[[0,1,2,3,4,5,6,7,8,9],[,,,,,,,,]]$

Third Pass

$\backslash$table$[[0,1,2,3,4,5,6,7,8,9],[,,,,,,,,,]]$