Write a recursive method (no loops) which takes in a non-negative integer and returns the sum of all the digits in a number. You should call this method recursiveSum.

For Example: recursiveSum(126) would return 9 as 1 + 2 + 6 = 9