Week 05B The Fibonacci sequence can be defined as follows: Fo = 0, F = 1, F, = Fn-1 + Fn-2 Create a function that takes inn, and returns a tuple of (F_n, F_(n+1)). >>> pair_fibo0) (0, 1) >>>...

The programming language is Python

Extracted text: Week 05B The Fibonacci sequence can be defined as follows: Fo = 0, F = 1, F, = Fn-1 + Fn-2 Create a function that takes inn, and returns a tuple of (F_n, F_(n+1)). >>> pair_fibo0) (0, 1) >>> pair_fibo(5) (5, 8) >>> pair_fibo(8) (21, 34) Write the function pair fibo(n) to return the value (F_n, F (n+1)). If recursion is used, the return value of pair_fibo(n) should be obtained from only calling pair_fibo(n-1) exactly once.