question 2 please write in print and explain the answer thank you

File dit ViewHeln 100 ew only Name 1. (25 points) Suppose you are given the task to sort one thousand 32-bit keys. You have decided to use radix sort for this problem and want to decide how many bits each radix sort digit. Which is best among having 1 bit per radix sort digit, 4 bits per radix sort digit, 8 bits per radix sort digit or 16 bits per radix sort digit? You are provided with a counting sort procedure with exact time complexity of 5n +4k. Show your work. 2. (20 points) Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 253. Which of the following sequences could not be the sequence of nodes examined? Explain briefly in a sentence) your reasoning a. 900, 220, 880, 240, 850, 244, 256, 235, 253 b. 2, 153, 401, 390, 330, 240, 280, 250, 253 c. 153, 627, 594, 196, 502, 275, 247, 257. 253 d. 925, 200, 890, 210, 900, 240, 245, 300, 253 e. 245, 805, 448, 386, 418, 402, 390, 395, 253 3. Given the graph below a. (20 points) Give the adjacency-list and adjacency-matrix representations 511 PM O Type here to search 10/13/2018