A Fibonacci sequence is the integer sequence of 0, 1, 1, 2, 3, 5, 8.... The...

 

Transcribed Image Text:

A Fibonacci sequence is the integer sequence of 0, 1, 1, 2, 3, 5, 8.... The first two terms are 0 and 1. All other terms are obtained by adding the preceding two terms. The nth term is the sum of (n-1)th and (n-2)th term. Define a function which accepts a passed argument and calculates its Fibonacci sequence. A program accepts user's input and calls the function. (Please use recursive function call in the function definition.) (Sample output as shown in the following figure is for demonstration purposes only.) How many terms? -1 Please enter a positive integer How many terms? 1 Fibonacci sequence up to 1: 0 How many terms? 10 Fibonacci sequence up to 10: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34 A Fibonacci sequence is the integer sequence of 0, 1, 1, 2, 3, 5, 8.... The first two terms are 0 and 1. All other terms are obtained by adding the preceding two terms. The nth term is the sum of (n-1)th and (n-2)th term. Define a function which accepts a passed argument and calculates its Fibonacci sequence. A program accepts user's input and calls the function. (Please use recursive function call in the function definition.) (Sample output as shown in the following figure is for demonstration purposes only.) How many terms? -1 Please enter a positive integer How many terms? 1 Fibonacci sequence up to 1: 0 How many terms? 10 Fibonacci sequence up to 10: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34