Analyze the following algorithm by answering the below questions:

Mystery $($A$[$O$..$n$-$I$])$

$//$Input: An array A$/$O$..$n$-1]$ of integer numbers

$\frac{\frac{?}{?}}{B}[0$dots$9]$ another array of integer numbers originally initialized to all zeros

$\frac{\frac{?}{?}}{\%}$ is the integer number remainder operator

$//$ new line is a character that allows the next print operation to be done on the next line

for ilarr$0$ to $n-1$ do

$B[A[i]\%10]=B[A[i]\%10]+1$

for ilarr$0$ to $9$ do

for jlarr$1$ to $B[i]do$

print $"."$

print new$\_$line

a$.$ What does this procedure achieve?

b$.$ Problem size parameter?

c$.$ The algorithm has two consecutive parts: