Write a recursive method called digitCount$()$ that takes a non$-$negative integer as a parameter and returns the

number of digits in the integer. Hint: The digit count increases by $1$ whenever the input number is divided by

Ex: If the input is:

Enter an integer: $345$

the method digitCount$()$ returns and the program outputs:

There are $3$ digits in the number $345$

Skeleton:

import java.util.Scanner;

public class Recursion $\{$

$/*$ TODO: Write recursive digitCount$()$ method here. $*/$

public static void main$($String$[]$ args$)\{$

Scanner scnr $=$ new Scanner$($

System.in$)$;

int num, digits;

num $=$ scnr$.$nextInt$()$;

digits $=$ digitCount$($num$)$;

System.out.println$($digits$)$;

$\}$