(In Java programming language) Given H and N, compute recursively and return an integer which indicates the number of way to climb a set of stair of the given height H while each climb is up to N steps

i.e

There is only 1 possible way for climbing a staircase of height 4, while each climb takes 1 step. 1. 1 step, 1 step, 1 step, 1 step

There are 5 possible ways for climbing a staircase of height 4, while each climb takes either 1 or 2 steps. 1. 1 step, 1 step, 1 step, 1 step 2. 1 step, 1 step, 2 steps 3. 1 step, 2 steps, 1 step 4. 2 steps, 1 step, 1 step 5. 2 steps, 2 steps