in algorithm analysis

Q1. Apply radix sorting to the following list of keys as given in class: 4184, 1577, 8119, 1023, 339, 4654, 9341, 3298, 8343, 972 Show the contents of Queue and Ql0]..Q/9] after every phase of ordering. Q2. Write the pseudo code for a radix sort algorithm for sorting n Hexadecimal keys The key length is m digits. Show all data structures used. Apply your algorithm to the tep 6EADO 6CA82 EABCO F7643 5DCEF Q3. Write an algorithm to find both maximum and minimum element of a list of n elements using no more than 3 L n/2] comparisons (Hint: Read pages 214-215 in the textbook.)