Before the question a, I wanna make sure that does the bucket must use dictionary (K,V)?

Question 2 (7 marks) a) A bucket sort uses key values as indices into an auxiliary array as part of the sorting process. Explain how a collection of strings can be sorted using a bucket sort. (2 marks) b) A radix sort is a specialised type of lexicographic sort. i. Explain how a radix sort can be used to sort a collection of integers. ii. Compare the performance of using a radix sort versus a bucket sort, to sort a collection of n integers with values in the range of 0 to N. The comparison should comment on both run-time complexity and space complexity of both sorts. (3 marks) c) Comparison sorts perform their sorting process by comparing key values to determine their relative ordering. i. What is the best-case run-time performance of any comparison sort? Explain how this can be determined. ii. Is a bucket sort a comparison sort? Explain why or why not. (2 marks)