1. Write a Java recursive method to print Fibonacci series of n terms. Fibonacci series starts...

 

Transcribed Image Text:

1. Write a Java recursive method to print Fibonacci series of n terms. Fibonacci series starts with 0 and 1, and the sum of previous two numbers is the next number of the series. For instance, 0, 1, 1 (0+ 1), 2 (1+1), 3 (1+2), and so on. (10 points) Sample input: 10 Sample output: 0112358 13 21 34 1. Write a Java recursive method to print Fibonacci series of n terms. Fibonacci series starts with 0 and 1, and the sum of previous two numbers is the next number of the series. For instance, 0, 1, 1 (0+ 1), 2 (1+1), 3 (1+2), and so on. (10 points) Sample input: 10 Sample output: 0112358 13 21 34