This is a recursion problem for java. Would like a simple and clear answer thanks in advance

Given a non-negative int n, return the sum of its digits recursively (no loops). Note that mod (%) by 10 yields the nghtmost digt (126% 10 is 6), while divide U) by 10 removes the rightmost digit (126/10 is 12) sumDinits(126) 9 sumDigits(49) 13 sumDiaits(12)-3 IF