Problem $1$

In example program Example$11$Recursion, write a recursive function sumDigits$($int n$)$

that computes the sum of the digits in the given integer n$.$

For example, a function call sumDigits$(429875)$ should return $35.$

Problem $2$

In example program Example$11$Recursion, implement a recursive approach to counting the

occurrences of uppercase letters in a given string s$.$ You should define the following two

functions, the second of which is a recursive helper function that uses parameter high to

indicate the right boundary of the substring for the function to check on$.$

int countUppercase$($String s$)$

int countUppercase$($String s$,$ int high$)$

For example, a function call countUppercase$($Computer Networking:

Protocols&Applications$)$ should return $4.$