Consider the modified form of the Fibonacci series, as follows: F(n) = F(n-1) + F(n-2) +F(n-3), if n>3, and =1, if n=1, n=2, or n=3. The first several numbers in the series are 1, 1,1,3,5,9, 17, 29, . We will call this series for fun as FibonaThree, which is a 3rd order recurrence equation.

3. Write a recursive Java program, using BigInteger class to compute F(n). In particular, you will write a method like this that returns the integer String as the answer.

public String recFib3(int n) {

}