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 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

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

A Fibonacci sequence is a sequence of numbers (called Fibonacci numbers) in which each number is the sum of the two preceding ones as following: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ... The task is to implement two functions in C a) using recursive function style, F(n) = F(n − 1) + F(n − 2) when n ≥ 2, F(0) = 0, F(1) = 1.

What is a recursive function?a.A function that performs arithmetic operations.b.A function that never terminates.c.A function that calls itself within its body.d.A function that only uses iteration.Clear my choice

a). Recursive function helps to solve the certain problems quite easily.i). What is meant by “Recursive Function”? [10%]ii). How it differs from “Iteration”? [10%]Questions 04Pages 04