Question: 102
(Choose 1 answer)
(See picture)
A. 15
B. 18
C. 21
D. 24
E. None of the other choices is correct
Suppose that the number of ways to solve an n-piece puzzle satisfies the recurrence relation
fnfn-2+nfn-3
with the initial conditions
f₁ = 1, f2 = 2, fs = 3.
How many ways are there to solve a 6-piece puzzle of this kind?
