Develop a Python function to calculate the nth number in Fibonacci sequence using recursion.
In mathematics, the Fibonacci sequence is a series of numbers where each number (after the first two) is the sum of its two immediate predecessors. The sequence starts with 0 and 1, and follows the formula: - F(0) = 0 - F(1) = 1 - F(n) = F(n-2) + F(n-1), for n > 1 You are required to write a recursive Python function, named `solution(n)`, that calculates and returns the nth number in the Fibonacci sequence. ### Parameters - `n`: An integer indicating the position of a number in the Fibonacci sequence. ### Return Value - The function should return the nth number in the Fibonacci sequence. ### Examples ```python # The 0th number in the Fibonacci sequence is 0 solution(0) # 0 # The 1st number in the Fibonacci sequence is 1 solution(1) # 1 # The 2nd number in the Fibonacci sequence is also 1 solution(2) # 1 # The 8th number in the Fibonacci sequence is 21 solution(8) # 21 ```