Define a recursive procedure sum-of-digits that runs as an iterative process – and that takes a whole number as an argument and returns the sum of its digits.

(sum-of-digits 0) ! 0

(sum-of-digits 3) ! 3

(sum-of-digits 321) ! 6

(sum-of-digits 0) ! 0

(sum-of-digits 3) ! 3

(sum-of-digits 321) ! 6

### Recently Asked Questions

- Please View Screenshot above. For the following equation, determine the values of the missing entries. Reduce all fractions to lowest terms. 12x−8y=12

- Please refer to the attachment to answer this question. This question was created from Quiz 1 - 405_Q1_F16.

- Give an example of how a company that has resolved an ethical issue in a positive way. Also, explain how this resolution is good for the entire community.