4. [5] Shell Sort. Given the starting array shown below, give the result of shell sort with the gap values indicated in the table. 5. [2 pts] Radix Sort. What is the time complexity of Radix sort as a function of the following factors : - N - number or elements - w - maximum number of digits - b - bucket size Answer . 6. [6] QuiekSort. A. [4] Choosing the median of left, right and center elements as the pivot in a QuiekSort algorithm, give the result of 2 partitions. B. [1] What is the time complesity of the partition method? c. [1] What is the space complexity of the partition method