use recursion

no scanner method

starter code to use

explain how the code will work at the end

The root digit of a number is found by first computing the sum of each of the digits in that number. If the sum is a single-digit number, then that is your root. If it is not, then compute the sum of each of the digits in the sum you computed for Step 1. Repeat this process until you get a sum that is a single-digit number, which will be your answer. Examples: - 145(1+4+5=10)10(1+0=1)1 - 294(2+9+4=15)15(1+5=6)6 - 8699(8+6+9+9=32)32(3+2=5)5 Create a function named rootDigit that receives one long integer as a parameter, then returns the root digit of that number. Header: int rootDigit( long num ) \{ II Type code here Notes: - Must use recursion to earn full credit - For a review on recursion, visit these two links: public class MyClass \{ static int rootDigit( long num ) \{ /I WRITE CODE' HERE \} public static void main(string args[]) I/ TEST CODE HERE \}