Recursion

For this assignment, you will write two recursive functions, both of which will parse any length string that consists of digits and numbers.$$ Both functions should be in the same class and have the following signatures.$$ Make sure you follow the UML exactly, as I will be running unit tests on your submission using this interface.

$1.$ Write a recursive function that will add up the digits in the string.$$ Example inputs and results:

input string result

$"1$d$2$d$3$d$"6$

$"55"10$

$"$xx$"0$

$2.$ Write a recursive function that will find the largest integer in this string.$$ Some Examples:

input string result

$"12$x$8"12$

$"012$x$88"88$

$"012$x$88$ttttt$9$xe$33$ppp$100"100$