Let the elements of the sequence S to be sorted belong to the set {O , XXXXXXXXXXm 1, }. A sorting algorithm known as sorting by bucketing first distributes the elements among a number of buckets that...

Let the elements of the sequence S to be sorted belong to the set {O , 1. . . m 1, }. A sorting algorithm known as sorting by bucketing first distributes the elements among a number of buckets that are then sorted individually. Show that sorting can be completed in 0(log n) time on the EREW model using n processors and O(mn) memory locations.