Scheme number computer

a. Write a recursive procedure (digits n) that computes the number of digits in the integer n using a recursive process. For example, (digits 42) should return 2 and (digits 13579) should return 5. You may make use of the built in floor predicate for truncating decimals to whole numbers.

b. Rewrite your procedure from part (a) using an iterative process. Call the function (digits-iter n).