General questions: a) What is the best running time for any comparison sorting algorithm? b) When would you use counting sort? c) Can radix sort use any counting sort or only the stable one? Provide a counterexample d) How would you split n 32 words into digits for radix sort? e) Finding half of the top students in our class can be found in O(n). True or False? How? f) Give examples of problems where stacks, queues, linked lists, trees can be used. g) Where is hashing useful? (Dictionaries, a lot of searching lookup) h) Describe the different ways of resolving collisions. Pros and cons of each