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 refer to the attachment to answer this question. This question was created from test 2.docx.

- Suppose X is a normal with zero mean and standard deviation of $10 million. a) Find the value at risk for X for the risk tolerances h=0.01, 0.02, 0.05, 0.10,

- What are typical roles and rules that one might see in a chemical dependent family? can you elaborate