Problem 1. Below is an input array from the universe U {0, 1, ...,999}. The for-loop in radix sort with |D = 10,|U| = 1000 iterates log|pi|U| = 3 times. 329 442 917 640 287 194 385 874 500 499 Fill in the array after the first iteration of radix sort. 640 Fill in the array after the second iteration of radix sort. Fill in the array after the third (and final) iteration of radix sort. Problem 2. Below is an input array from the universe of length-4 lowercase alphabetic strings. The for-loop in radix sort with |D = 26,|U= 264 iterates log|p|U| = 4 times. "abcd" zydq "booo" "zoom" "exam "tree" "smol" "code" "cats" "skis" Fill in the array after the first iteration of radix sort. Fill in the array after the second iteration of radix sort. Fill in the array after the third iteration of radix sort. Fill in the array after the fourth (and final) iteration of radix sort