Consider the following recursive definition of a function f.

f(n) = f(n-1) + f(n-3)

f(1) = f(2) = f(3) = 1

A

f(n) increases slower than 2^n

B

Both A and D

C

f(n) increases faster than 1.25^n

D

f(n) increases faster than 2^n

E

f(n) increases slower than 1.25^n

Boost your performance with adaptive practice tests

Practice every concept in the syllabus

Compare your speed and accuracy with your peers

Download the app and practice on the go