Calculate the number possible jumps a frog can make up a staircase, taking 1 to n steps per leap.
In this task, you are required to calculate the number of unique pathways a frog can take to ascend a staircase. The staircase consists of `n` steps and the frog has the ability to leap from 1 to `n` steps at once. This task entails the creation of a Python function that utilizes recursion to calculate the total number of unique ways the frog can ascend a staircase of `n` steps. ### Parameters - `n`: A representation of the total number of steps in the staircase which the frog needs to ascend. It should be an integer and should satisfy the condition (1 ≤ n ≤ 20). ### Return Value - The function should return the total number of unique sequences that the frog could use to ascend the staircase, with the potential of making a leap comprising any number of steps up to `n`. ### Examples ```python # With 4 steps, there are 8 unique ways a frog can ascend the staircase solution(4) # Expected output: 8 # With 5 steps, there are 16 unique ways a frog can ascend the staircase solution(5) # Expected output: 16 # With 10 steps, there are 512 unique ways a frog can ascend the staircase solution(10) # Expected output: 512 ```