You are going to climb up a staircase that has an n number of stairs, starting from bottom. In each step, you can only move up either one or two stairs.
Note that, as an example, after reaching the 3rd or 4th stairs, you can climb up to the 5th stair in 2 ways;
I. move up 1 stair from the 4th stair, and II. move up 2 stairs from the 3rd stair.
Develop a Python program to take an integer n as input (0 < n < 120) and display the number of ways you can climb up to the nth stair. You may handle unexpected inputs appropriately.
Input: Single integer n (0
Output: Single integer
8 Case 2:
Above is a question from one of my computer assignments. I don’t understand how to calculate the number of possible ways. To start coding I need a solution to the problem. How do I find the number of possible ways to climb the staircase.