Write JAVA program for Recursion follow

1. Given a string, compute recursively (no loops) the number of times lowercase hi appears in the string.

2. Given a string, compute recursively a new string where all the x chars have been removed.

3. Given an array of ints, compute recursively if the array contains somewhere a value followed in the array by that value times 10. Well use the convention of considering only the part of the array that begins at the given index. In this way, a recursive call can pass index+1 to move down the array. The initial call will pass in index as 0.

4. Given a string, compute recursively a new string where all the lowercase x chars have been moved to the end of the string.

5. Given a non-negative int n, return the sum of its digits recursively (no loops). Note that mod (%) by 10 yields the rightmost digit (126 % 10 is 6), while divide (/) by 10 removes the rightmost digit (126 / 10 is 12).

6. Given a string, compute recursively (no loops) a new string where all the lowercase x chars have been changed to y chars.

7. Given a string, return recursively a cleaned string where adjacent chars that are the same have been reduced to a single char. So yyzzza yields yza.