Consider the following algorithm to sort an array:

a) Apply the algorithm to sort the list 5, 7, 3. In other words, assume that the array A[ ] has the initial values 5, 7, and 3. Present the contents of the arrays A[ ], S[ ], and Count [ ] after finishing the execution of the algorithm. Show outputs.

b) Similarly, present the contents of the three arrays if the array A[ ] has the initial values 9, 3, 9, 3, 6? show outputs.

Algorithm ComparisonCountingSort(Al0..n -1], S[0.n -1]) //Sorts an array by comparison counting /Input: Array Al0.n 1 of orderable values //Output: Array S[o..n 1 of A's elements sorted in nondecreasing order for i 0 to n-ido Count[i] 0 for i 0 to n-2d for j i + 1 to n-Ido Count[j] CountLil + 1 else Count[i] Count[i] + for i 0 to n-ido