Complete the implementation of method sumOfDigits(int num), return the sum of its digits recursively. Consider using mod

[answerhappygod]

Complete the implementation of method sumOfDigits(int num),
return the sum of its digits recursively. Consider using mod(%)
operator to get the right-most digit in your solution.
Sample runs
Input 1:
Output 1:
Input 2:
Output 2:
Given Code
import java.util.Scanner;
public class Test {
public static void main(String[] args) {
Scanner stdin = new Scanner(System.in);
while (stdin.hasNextInt()) {

System.out.println(sumOfDigits(stdin.nextInt()));
}
stdin.close();
}
public static int sumOfDigits(int n) {
// your code starts here
// your code ends here
}
}