We use Radixsort to sort the following array A of integers: A[0] =2374, A[1] = 1809, A[2] = 7888, A[3] = 9124, A[4] = 68

[answerhappygod]

We Use Radixsort To Sort The Following Array A Of Integers A 0 2374 A 1 1809 A 2 7888 A 3 9124 A 4 68 1 (14.77 KiB) Viewed 11 times

We use Radixsort to sort the following array A of integers: A[0] =2374, A[1] = 1809, A[2] = 7888, A[3] = 9124, A[4] = 6844 Let A₂ = A and denote by A; the array A at the end of iteration of the main loop of Radixsort. In how many iterations of the main loop of Radixsort does the relative order of the numbers 1809 and 9124 in the input array change, i.e., how many i≥ 1 are there such that the relative order of the numbers 1809 and 9124 in A; and A;-1 is different? Enter your answer as an integer here: