Consider the following recursive definition of a function f.
f(n) = f(n-1) + f(n-3)
f(1) = f(2) = f(3) = 1
f(n) increases slower than 2^n
Both A and D
f(n) increases faster than 1.25^n
f(n) increases faster than 2^n
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