1. Recursive Multiplication Write a recursive function that accepts two arguments into the parameters x and y. The function should return the value of x times y. Remember, multiplication can be performed as repeated addition as follows 5 x 6 66+ 66 6 2. Recursive findings Write a recursive boolean method named reFinding. The method should search an array for a specified value, and return true if the value is found in the array, or false if the value is not found in the array. Demonstrate the method in a program. 3. String Reverse Write a recursive method that accepts a string as its argument and prints the string in reverse order. Demonstrate the method in a program. 4. maxElement Method Write a method named maxElement, which returns the largest value in an array that is passed as an argument. The method should use recursion to find the largest element. Demonstrate the method in a program. 5. Recursive Power Method Write a method that uses recursion to raise a number to a power. The method should accept two arguments: the number to be raised and the exponent Assume that the exponent is a nonnegative integer. Demonstrate the method in a program. 6. Sum of Numbers at accepts an integer argument and returns the sum of all the Write a method th integers from 1 up to the number passed as an argument. For example, if 50 is passed as an argument, the method will return the sum of 1, 2, 3, 4, .. . 50. Use recursion to calculate the sum. Demonstrate the method in a program