Please trace through this algorithm step by step to show how the list is sorted using this algorithm. Thanks

1.Consider the algorithm for the sorting problem that sorts an array by counting. for each of its elements, the number of smaller elements and then uses this information to put the element in its appropriate position in the sorted array: ALGORITHM ComparisonCounting SortCAlo.n 1]) //Sorts an array by comparison counting //Input: Array A[O.n -1] of orderable values //Output: Array s[o. 1] of A's elements sorted /l in nondecreasing order for i_ 0 to n-_ 1 do Count [i] 0 for i 0 to n _ 2 do for j _ i + 1 to n _ 1 do if Ali] AU] Count[j] Count[j] + 1 else Count[i] Count [i] + 1 for i 0 to n-Ido S[Count [i]] A[i return S a. Apply this algorithm to sorting the list 60, 35, 81, 98, 14, 47