I want to solve 5 and 6 only (JAVA LANGUAGE)

1) Write a recursive method stutter that returns a string with each character in its argument repeated. For example, if the string passed to stutter is "hello", stutter will return the string "hheelllloo".

2) Write a recursive algorithm that determines whether a specified target character is present in a string. It should return true if the target is present and false if it is not. The stopping steps should be a. a string reference to null or a string of length 0, the result is false b. the first character in the string is the target, the result is true. The recursive step would involve searching the rest of the string.

3) Write a recursive method that implements the recursive algorithm for searching a string in question 2. The method heading should be: public static boolean searchString (String str, char ch)

4) Write a recursive method to find the sum of all values stored in an array of integers.

5) Write a recursive algorithm for method insert(E obj, int index) where index is the position of the insertion. a. Code method insert

6) Write a recursive algorithm for method remove(int index) where index is the position of the item to be removed. a. Code method remove