Recursive function that returns the number of digits in a number

Question

I have a exercise in school that asks me to do a recursive function numdigits(int n) with only one variable(n). for example the number 123 have 3 digits, and 0 have 1 digit. Im