Return number of ways to climb n=7 stairs with steps 1 or 2. This is a classic dynamic programming (DP) problem. You are standing at the bottom of a staircase with 7 steps. Each move, you can climb either 1 step or 2 steps. You must count:❓ How many different sequences of steps will get you to the top?