(a) To give the inorder traversal of the tree. (5%)

3. Suppose that we are going to sort 10 numbers in the range [0, 999]. We use LSD radix sort with radix r = 10 and pass d = 3 to sort the numbers in an ascending order. The input list is linked, and the numbers are 179, 208, 306, 93, 859, 984, 55, 9, 271, and 33. To write the first-pass, second-pass, and third-pass resulting chains when performing the LSD radix sort. (20%)