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:

1. Apply this algorithm to sorting the list 110, 65, 21, 98, 14, 47.

2. Is this algorithm stable?\

3. Is it in-place?

for it to n - 1 do Count[i] +0 end for for i = 0 to n - 2 do for j i+ 1 to n - 1 do if A[i]