$$ \begin{array}{1} \text { 3. Analyze the complexity of following algorithms in terms of big } \mathrm{0} \text {. [2* } 2 \text {]} \begin{array}{[110] \hline \mathrm{i}=\mathrm{n} ; & \text { for }(\mathrm{i}=-10 ; \mathrm{i} 0)\{ & \mathrm{a}=\mathrm{a}-10 ; W \quad \text { for }(\mathrm{j}=\mathrm{n} ; \mathrm{j}>=\mathrm{i} ; \mathrm{j}=\mathrm{j} / 10){ & \mathrm{b}=\mathrm{b}+\mathrm{a} ; \quad \text { sum}++ & \text { sum }++; W \quad\} & } \quad \text { i--} & \} & \hline \end{array} \end{array} $$ CS. JG.005