$(5$ marks$)$ For the given CountingSort algorithm, answer the following if the input array is given below:

Courtingasoar $(1,0,k)$

$1$ the is $1,1$ to $4$

$co{s}_{10-0}^{}C{l}_{10}-0$

$16n$

$C_M{9}_{11}(I)-q_9(J)+1$

${}_0{}_{in}-q_n(+c_{t-1})$

ior $\frac{{?}^f}{\text{I}}$ now contains the mumber of elements leas than or equal to $i$

$10$

$10$

C$$I$--13$

b$.q,$

c

$(2$ marks$)$ Write the content of the array $B$ at the end of CountingSort if the content of the array $C$ after line $7$ is given as follows. Note: input array $A$ is not given and assume index in all arrays start with $1$

$[3,3,3,3,4,8\}$