(10 points) Suppose a list of n distinctive numbers stored in an integer array int a[] are sorted with the support of a table int t[]. After the sorting, a[t[0]], .., a[t[n-1]] are in the ascending order but the numbers in array a[] are not moved. Also, disjoint cycles are formed in t[O] ..., t[n-1]. The C program tableSort() given below is to perform table sort which takes advantage of the disjoint cycles and rearranges a[0:n-1] to correspond to the sequence at[0]], ..., at[n-1]]. That is, after performing tableSort(), the numbers stored in array a[] is in ascending order. Please fill out the blanks in the following to complete the program. 1 void tableSort(int a[], int n, int t[]) 2 { int i, current, next, temp; 3 for (i = 0; i