Find f(1), f(2), f(3), and f(4) if f is defined recursively by f(0) = 1 and for n =1, 2,... f = n - f(n-1).Select one:a.0, 2, 1, 3b.-1, 3, 0, 4c.None of the othersd.-1, 1, -1, 1e.0, 1, 2, 3

Give a recursive definition of the function f = 5.3n, n = 0, 1, 2, ...Select one:a.f = 3.f(n-1) if n > 0, and f(0) = 5b.f = 5.f(n-1) if n > 0, and f(1) = 15c.None of the othersd.f = 5.f(n-1) if n > 0, and f(0) = 5e.f = 3.f(n-1) if n > 0, and f(1) = 15

Find the nth fibonacci numberThe Fibonacci Sequence is the series of numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …The next number is found by adding up the two preceding numbers.Let F[i] be the ith fibonacci numberF[0]=0F[1]=1F[i]=F[i-1]+F[i-2]This problem can be solved very easily by using recursion. But this is not an efficient solution. Using DP, we can solve this problem in O. You are required to solve this in a bottom up manner and keep caching all the values to avoid recomputation.Sample Input:3     Sample Output: 2

In the function f(n) = 3n - 7, what are the first 5 terms?Select one:a. 1, 2, 3, 4, 5b. 3, 5, 7, 9, 11c. -4, -1, 2, 5, 8d. -7, -5, -3, -1, 1

Suppose that f = 2f(n/2) + n, when n is an even positive integer, and f(1) = 0. Find f(8).Select one:a.8b.64c.16d.None of the otherse.24

The Fibonacci sequence is F(n) = F(n – 1) + F(n – 2).If F(8) = 21 and F(9) = 34, which of the following is true?A.F(10) = 55B.F(13) = 21C.F(10) = 53D.F(17) = 55