hi, i need to code this in python

The Fibonacci sequence can be defined as follows: Fo=0, Fi = 1, F = F-1 +Fr-2 Create a function that takes in, and returns a tuple of (En, F_( m1)) >>> pair_Fibo(@) (e, 1) >>> pair_fibo(5) (5.8) >>>> pair_fibo (8) 021, 34) Write the function partibotni) to return the value of 3)) If recursion is used the return value of the should be obtained from only calling pait fibon-1) exactly once