Count The Digits

Complete count_digits(n: int) -> int so it returns how many digits a non-negative integer has, by recursion. The base case is written: a number below 10 has 1 digit. Add the recursive case, which returns 1 plus the digit count of n // 10, the number with its last digit dropped by floor division. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: one integer n, no prompt, which the tests read and pass to your function before printing the value it returns.