Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Recursionhard
0:00.0

A store sells lollipops in packs of 1, 2, or 3. The number of distinct ordered ways to purchase exactly nnn lollipops is denoted f(n)f(n)f(n) (e.g., for n=3n=3n=3: buying "1+2" differs from "2+1"). Which recurrence describes f(n)f(n)f(n)?