Basic Recursion Programs

1.Sum of Digits Example: 123 → 1 + 2 + 3 = 6 --> add all digits of a number Formula sum(n) = (n % 10) + sum(n / 10) java public class Main { static int sumDigits(int n) { if (n == 0) return 0; return (n % 10) + sumDigits(n / 10); } public static void main(String[] args) { System.out.println(sumDigits(123)); } } python def sum_digits(n): if n == 0: return 0 return (n % 10) + sum_digits(n // 10) print(sum_dig