☑Kizspy.me
(Choose 1 answer)
(See picture)
☐ A
A. 24, 45, 93.
☐ C
B. 18, 21, 45.
Back
Next
C. 9, 21, 45.
D. 12, 21, 45.
Suppose that f(n) is defined recursively by:
f(0) = 3,
f(n + 1) = 2f(n) + 3, n = 0, 1, 2,....
Find f(1), f(2), f(3).
FUO.sh
sh the exam.
