An alternative sorting algorithm to those presented in class, known as counting sort, works as follows: for each element of the unsorted array, count the number of elements which are smaller than this one, and store it in a separate array. Next, increment each element of this new array by one. The entries of the resulting array are precisely the order in which the elements of the original array should be put when the original array is sorted. Note: this algorithm requires special care when the unsorted array has an entry that is repeated two or more times. Here is an example of counting sort: Unsorted Elements 52 10 1 25 62 3 8 55 3 2 Counts 7 5 0 6 9 2 4 8 2 1 Index 8 6 1 7 10 3 5 9 3 2 Sorted Elements 1 2 3 3 8 10 25 52 55 62 Write a function with the declaration line begin code 1 function sarray