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

Let wnw_nwn​ be the number of ways to make change for nnn cents using only 1-cent and 2-cent coins. Which of the following recurrence relations holds for wnw_nwn​ for n≥2n \geq 2n≥2?