Illustrate the operation of Bucket Sort algorithm on the following array:

A = {200, 616, 559, 868, 597, 142, 639, 289, 43, 889, 455, 706, 368, 543, 67, 57, 760, 254, 515, 343, 991, 384, 79, 37, 145, 656, 581, 646, 395, 89}.

Please show your work.

Remember for the Bucket sort algorithm

Input: A[1..n], where 0 A[i] < 1 for all i .

Auxiliary array: B[0 ..n-1] of linked lists, each list initially empty.