Please do not copy/paste from previous questions asked and/or answered.

Also, please use as much detail as possible and clearly explain your reasons.

Exercise 3 (35 points) Bucket Sort BUCKET-SORT(A) let B[0..n - 1] be a new array 2 A.length 3 for0 to-1 4 make B[i] an empty list 5 fori1 to n 6 nsert Ali] into lst BlnAll 7 fori0 to -1 8 sort list Bi] with insertion sort 9 concatenate the lists B[O], B[1].... . B[n - together in order Suppose that we are given a sequence A of n 32-bit integers (a, a an) to sort such that 0 s a<.>