5. Given n uniformly distributed real numbers [0,1], a sorting algorithm called bucket sort (see textbook) can sort these numbers in expected linear time without assumptions on the precision (see textbook). Illustrate the bucket sort using {0.92, 0.823, 0.537, 0.3333, 0.877, 0.3} and prove the expected time complexity.