1. Write a recursive Java method that implements the following math function: f(n) = 1 + 23 +33 + ... + n. Complete the method using recursion. Pass a number to test it. Take screenshots. 2. Write a recursive Java method that has the following prototype: boolean findNumber (int array[ ], int number) { 1 The method receives an array and a number and finds out if the number is in the array. Complete the method using recursion. Pass an array and a number to test it. Take screenshots