COUNTing$-$SORT$(A,B,n,k)$

let $C[0$dotsk$]$ be a new array

for $i=0$ to $k$

$C[i]=0$

for $j=1$ to $n$

$j=1ton$

$C[A[j]]=C[A[j])+1$

for $i=1$ to $k$

$C[i]=C[i]+C[i-1]$

for $\frac{?}{\text{b}\text{a}\text{r}}(j)=n$ downto $1$

If you run COUNTING$-$SORT in the array below:

$\backslash$table$[[4,2,0,1,2,4,1,1,2]]$

What is the result of Array C after point A $(2$nd for loop$)$ is over?