Recursion Exercise

Recursion Exercises 1. Write a method to calculate a specific number in the Fibonacci Sequence using recursion a. Your method should be called fibCalc b. It will take three parameters i. int fibSeq1-the first number of the current iteration of the Fibonacci sequence ii. int fibSeq2-the second number of the current iteration of the Fibonacci sequence ili int count the number in the sequence you would like to start with c. This method should return an int d. All method calls for this method should look something like this i. seqNum- fibCalc(0, 1, count);//where count holds the sequence position you would like to find 2. Write a method to sum all the values in an integer array using recursion a. Your method should be call summation b. It will take three parameters i. intl nums-the array of numbers to sum ii. int index -the current index of the number to sum iii. int numLeft - the number of elements left to add c. The method will return an int representing the summation of the array d. All method calls for this method should look something like this i. sum summation(nums, 0, nums.length)