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» E.