What is the time complexity of the above recursive implementation to find the sum of digits of a number n?

O(len(n)), where len(n) is the number of digits in n

What is the time complexity of the above recursive implementation to f

1.	What is the time complexity of the above recursive implementation to find the sum of digits of a number n?
A.	O(n)
B.	O(1)
C.	O(len(n)), where len(n) is the number of digits in n
D.	none of the mentioned
Answer» D. none of the mentioned