C++

Fibonacci Application

Design and implement your solution for the following problem. You're standing at the base of a staircase and would like to get to the top. A small stride will take you up one step while a large stride takes you up two steps. You would like to count the number of possible ways you could climb the entire staircase based on different combinations of large and small strides. For example, a staircase with three steps can be climbed in three different ways: three small strides one small stride followed by one large stride one large followed by one small stride How could you apply the Fibonacci number series to this problem? What are the base cases for counting the ways you can climb stairs by going one stair or two stairs at a time? How many different ways can you climb 4 stairs? 5 stairs?