You are given an example of a function called factorial (integer) that uses recursion. Study it closely to follow its logic. Write 2 methods using recursion: 1) Raise to Power (int base, int exponent) -- this calculates the base number raised to the exponent. 2) Fibonacci (int terms) -- Prints out in a list the Fibonacci sequence up to "terms". For example, if terms is 6, the list would contain (1, 1, 2, 3, 5, 8). Write this method using the factorial method I gave you: 3) Combination (int n, int k) -- this calculates the number of combinations that can be arranged when looking for k successes out of n choices.
