3. (30 points) 3(a). ( 15 points) Illustrate the operation of Bucket Sort on the following array A = {o. 79 , 013, 0.16, 0.64, 0.39, 0.20, 0.89, 0.53, 0.71, 0.42). You are free to pick the number of buckets you want as well as the function that puts data into the buckets (e.g., you can use the function given in the slides) 3(b). (15 points) Explain why the worst-case running time of Bucket Sort is O(). What simple change can you make to the algorithm to make its worst case running time O(nlogn)