Counting Sort

Computer Science

Given the array $A$ , during the counting sort algorithm, what does the $C$ array look like when it is first completed (before any modification)?

$A = [0,4,1,7,5,5,6,4,3,3,4,2,1,9,8,4,6]$

[1, 2, 1, 1, 3, 1, 2, 1, 1, 1]

[0,1,2,3,4,5,6,7,8,9]

[1,1,1,2,2,4,2,1,2,1]

[1, 2, 1, 2, 4, 2, 2, 1, 1, 1]