Sorting Algorithm Algorithm ComparisonCountingSort (A(0..n 1],S[0..n -1]) //Sorts an array by comparison counting //Input: Array Al0..n 1 of orderable values //Output: Array S[0.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 if AuA Count [j] Count[7] + 1 else Count[i] Count[i] + 1 for i 0 to n-ido S[Count[i])-Alil (a) Apply the algorithm to sort the list 5, 3. In other words, assume that the array A[] has the initial values 5 and 3. Present the contents of the arrays A[], S], and Count [] after finishing the execution of the algorithmm