2. Write a recursive method called evenSumO that takes one int parameter and returns the cumulative sum of the numbers up to n. [cumulativeSum(n)-2+4+6n) 1. What will be the output when the following program is 3. Write a recursive method called fib0 that takes an int executed? parameter and that returns the Fibonacci number at that location in the series. The Fibonacci sequence is a sequence of numbers in which the first two numbers are 1 and each subsequent number is sum of the previous two Fibonacci numbers. The sequence is 1,1,2,3,5,8,13,21, and so on. So fib(4) should print 3, fib(6) should print 8, fib(8) should print 21, fib(10) should print 55 and so on public class Recur ( public static void main (string 11 arga) print (5) public statio void print (int n) if (n1-0)( print (n-1) printhum (n) ystom-out.printin) public static void printhum (int n) t n) yatom.out.print nn printhum (n-1)