Please clearly justify your answer

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