Consider the algorithm for sorting problem that sorts an array by counting, for each of its element, the number of smaller elements and then uses this information to put the element in its appropriate position in the sorted arrays a. Apply this algorithm to sorting the list 60, 35, 81, 98, 14, 47 b. Is this algorithm stable ? c. Is it in-place