Consider the following bucket sort algorithm, the pseudocode is given below: Special BucketSort(arr): n = arr.length arrBucket[0..n-1] be an empty array of lists for i= 0 to n-1 //hash function determines which bucket the element goes into insert arr[i] into list arrBucket[hash(arr[i])] for i=0 to n-1 sort list arrBucket[i] using insertion sort concatenate the lists arrBucket[0], arrBucket[1], ..., arrBucket[n-1] together in order a) What is the worst-case and best-case running time of this sorting algorithm and provide the scenarios in which each of these happen. [5 pts] b) By replacing insertion sort with a more efficient merge sort or heap sort in line 9 of the pseudocode, bucket sort can achieve a worst-case running time of O(nlogn) instead of 0(n). Argue why switching insertion sort to a more "efficient" sort is not a good idea. [5pts] c) If you have to sort a huge list that can't fit into memory. Would you use bucket sort or quick sort? Why?[5pts] Activate Win Go to Settings to