How would I implement this in Java? FYI the sample output is not complete, thats just the first 3 lines, but it should sort all 5 numbers

Input structure You are going to apply Radix-Sort to sort vectors. The input starts with an integer number which indicates the number of vectors to be sorted. Then vectors follow, one vector per line. Each vector consists of 10 digits where each digit has a value in 0...9. Entries of a vector are separated by a space Output structure Output the sorted sequence of vectors, one per line. Vectori must appear before vector j in your output if and only if for some d {1,2,..., 10}, vector i is smaller than or equal to vector j on the dth entry, and the two vectors are equal for any of the first d - 1 entries Examples of input and output Input 3 3 3 3 3 2 2 2 2 2 2 3 2 2 2 22 2 2 2 1 3 0 0 2 10 0 0 0 1 300 2 20 0 0 0 2 3 2 1 2 2 2 2 2 2 Output 2;3;2;1;2;2;2;2;2;2