In python please

4 annoying fibonacci(n) In annoying_recursion.py , write the function annoying_fibonacci(n) , which takes a single integer parameter (which must be non-negative). It must return the Fibonacci Number (https://en.wikipedia.org/wiki/Fibonacci_ number). The first two Fibonacci Numbers are fixed: F0 = 0 F1 = 1 and from then on, all Fibonacci Numbers are defined recursively: Fn = Fn1 + Fn2 However, your function must obey the Annoying Requirements. This means that you must hardcode the answer for 0,1,2,3. For 4,5,6 you must recurse, but you must hardcode the arguments that you pass to the recursive calls. Of course, you will use the general formula, as well - but only on the last case!