SECTION $2$: $(5$ POINTS$)$

In this section you will be given a number with some digits and then we need to find sum of

its digits using recursion. For example, for $12345$ your program must return $15,$ and for

$45632$ it must return $20.$

To give you a hint here is the step$-$by$-$step process for a better understanding of how the

algorithm works.

Let the number be $12345.$

Step $1->12345\%10$ which is equal$-$too $5+($send $\frac{12345}{10}$ to next step $)$

Step $2->1234\%10$ which is equal$-$too $4+($ send $\frac{1234}{10}$ to next step $)$

Step $3>123\%10$ which is equal$-$too $3+($ send $\frac{123}{10}$ to next step $)$

Step $4>12\%10$ which is equal$-$too $2+($send $\frac{12}{10}$ to next step $)$

Step $5>1\%10$ which is equal$-$too $1+($ send $\frac{1}{10}$ to next step $)$

Step $6->0$ algorithm stops.