Question

Task 3 (5 points) Write a program that will read a number and output the Fibonacci sequence from 1 to the n numbers using a recursive algorithm. In mathematics, the Fibonacci series are the numbers in the following sequence: 0, 1,1,2,3,5,8,13,21,34,55,89,144 ... The first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two. In mathematical terms, the sequence $F_n$ of Fibonacci numbers is defined by: $F_n = F_{n-1} + F_{n-2}$ Examples: Enter a number: 10 0, 1, 1, 2, 3, 5, 8, Enter a number: 20 0, 1, 1, 2, 3, 5, 8, 13, Rubric: Criteria Task 1 Task 2 Task 3 Marks 2.5 2.5 5 Total 10

          Task 3 (5 points)
Write a program that will read a number and output the Fibonacci sequence from 1 to the n
numbers using a recursive algorithm.
In mathematics, the Fibonacci series are the numbers in the following sequence:
0, 1,1,2,3,5,8,13,21,34,55,89,144 ...
The first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number
is the sum of the previous two.
In mathematical terms, the sequence $F_n$ of Fibonacci numbers is defined by: $F_n = F_{n-1} + F_{n-2}$
Examples:
Enter a number: 10
0, 1, 1, 2, 3, 5, 8,
Enter a number: 20
0, 1, 1, 2, 3, 5, 8, 13,
Rubric:
Criteria
Task 1
Task 2
Task 3
Marks
2.5
2.5
5
Total
10

Task 3 (5 points)
Write a program that will read a number and output the Fibonacci sequence from 1 to the n
numbers using a recursive algorithm.
In mathematics, the Fibonacci series are the numbers in the following sequence:
0, 1,1,2,3,5,8,13,21,34,55,89,144 ...
The first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number
is the sum of the previous two.
In mathematical terms, the sequence Fn of Fibonacci numbers is defined by: Fn = Fn-1 + Fn-2
Examples:
Enter a number: 10
0, 1, 1, 2, 3, 5, 8,
Enter a number: 20
0, 1, 1, 2, 3, 5, 8, 13,
Rubric:
Criteria
Task 1
Task 2
Task 3
Marks
2.5
2.5
5
Total
10

Added by Brittany B.

Question

Please give Ace some feedback