9.

10.

10 Show an example that the best-case running time of quick sort tree on a sequence of size n with distinct elements is Onlogn). Illustrate the execution of the Radix sort algorithm on the following input sequence: (271, 54, 65, 92, 912, 36, 9,86)