Implement the digit counting function recursively. Dividing by removes one digit at a time.
Your function takes an integer and returns how many digits it has.
Requirements:
- Base case: single-digit number (0-9) has digit
- Recursive case: count = + count of remaining digits after dividing by
- Handle as having digit
- Negative numbers: count digits of absolute value
Examples:
count_digits(5)->count_digits(123)->count_digits(0)->
The pattern: 123 // 10 = 12, which has digits, so 123 has digits total.