Implement MSD string sorting using queues, as follows:

Keep one queue for each bin. On a first pass through the items to be sorted, insert

each item into the appropriate queue, according to its leading character value. Then,

sort the sublists and stitch together all the queues to make a sorted whole. Note that

this method does not involve keeping the count[] arrays within the recursive method