A Python task to find the number of methods to climb a staircase either one or two steps at a time.
Write a function that calculates the total number of ways to climb a staircase where one can only climb either one or two steps at a time. ### Parameters - `n` (int): An integer value representing the total number of steps in the staircase. ### Returns - (int): The total number of methods for climbing the staircase. ### Examples ```python # For a staircase of one step, there is only one method to climb it solution(1) # 1 # For a staircase of two steps, there are two methods to climb it solution(2) # 2 # For a staircase of five steps, there are eight methods to climb it solution(5) # 8 ``` ## Template Code ```python def solution(n): pass # Test cases solution(1) # 1 solution(2) # 2 solution(5) # 8 ```