IN JAVA

Write a recursive method called cumulativeSum() that takes one int parameter and returns the cumulative sum of the numbers up to n. [cumulativeSum(n)=1+2+3+.+n-1+n]

Write a recursive method called fib() that takes an int 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.