Write a recursive method that will compute the sum of the digits in a positive number.

What will be an ideal response?

```
public static long sumDigits(long number){
long result;
if(number == 0)
// base case
result = 0;
else {
long digit = number % 10;
if(digit < 0)
digit = -1 * digit;
result = digit + sumDigits(number/10);
}

return result;
}
```

This code is in Methods.java.