Question: This is a Java exercise. You are climbing a stair case. It takes n steps to reach to the top. Each time you can either

This is a Java exercise. You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 or 3 or 4 steps. In how many distinct ways can you climb to the top? Write a method that calculates the steps and find how many ways there are for 4, 10 and 50 steps
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
