1-Suppose the list [12, 45, 87, 22, 10] is sorted with bucketsort. What pre-
processing would need to be done to the data and what size wouldthe
buckets be?
2-What is the order of memory usage for bucket sort? What wouldthe order
of memory usage be if static arrays were used instead of linkedlists?
3-Is bucket sort stable? If not, how can it be made stable?
Solution