Explain in detail (hand written maybe)how the counts are calculated as per the box as 0-4 is passed

Array A [0..4] Initially Aer pass i = U Aer pass i = 1 Aer pass i = 2 Aer pass i = 4 Final State Array S [(1.4] Q3. Consider the following 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 Sort(A[O..n - 1], S[0..n - 1]) //Sorts an array by comparison counting //Input: Array A[0..n - 1] of orderable values //Output: Array S[0..n-1] of A's elements sorted in non-decreasing order for i - 0 ton - 1 do Count[i] - 0 for i - 0 to n - 2 do for j - i+ 1 ton - 1 do if A[i]