[Solved]1 Fibonacci Sequence Series Integers 0 1 1 2 3 5 8 13 21 34 55 89 See Pattern Element Seri Q37282289

I need help with these two questions. Language is C++. thank youfor your time.

1. The Fibonacci sequence is the series of integers 0,1,1, 2, 3, 5, 8, 13, 21, 34, 55, 89, See the pattern? Each element in the series is the sum of the preceding two items. There isa recursive formula for calculating the n-th number of the sequence (the O-th number if Eibonacci(0)-0) Fibonacci(n) = n, if n = 0 or 1, and Fibonacci(n)-Fibonacci(n-2)+Fibonacci(n-1), ifn>1 Write a recursive version of the C++ function Fibonacci. 3. Mark the following statements as true or false. (a) A binary tree must be nonempty. (b) The level of the root node is 0. (c) If a tree has only one node, the height of this tree is 0 because the number of levels is 0 (d) The inorder traversal of a binary tree always outputs the data in ascending order. Show transcribed image text 1. The Fibonacci sequence is the series of integers 0,1,1, 2, 3, 5, 8, 13, 21, 34, 55, 89, See the pattern? Each element in the series is the sum of the preceding two items. There isa recursive formula for calculating the n-th number of the sequence (the O-th number if Eibonacci(0)-0) Fibonacci(n) = n, if n = 0 or 1, and Fibonacci(n)-Fibonacci(n-2)+Fibonacci(n-1), ifn>1 Write a recursive version of the C++ function Fibonacci.
3. Mark the following statements as true or false. (a) A binary tree must be nonempty. (b) The level of the root node is 0. (c) If a tree has only one node, the height of this tree is 0 because the number of levels is 0 (d) The inorder traversal of a binary tree always outputs the data in ascending order.

Expert Answer

---

Answer to 1. The Fibonacci sequence is the series of integers 0,1,1, 2, 3, 5, 8, 13, 21, 34, 55, 89, See the pattern? Each element… . . .