Write a complete Java program to count the number of one digits in a given

positive integer using recursion function. Use CountOne as the recursive

function name. You need to check for valid integer input and use the

mathematical division and modular operators in your program.

Sample screen Output as shown:

Example$1$:

Input:

Enter any positive integer to find the number of ones in the integer: $-3311$

Output:

Input integer cannot be negative

Example$2$:

Input:

Enter any positive integer to find the number of ones in the integer: $20151$

Output:

Number of ones in $20151$ is $2$