in python plz

f(a,b)=abf(a/2,b)+2af(a,b/2)+2bf(a1,b+1)ifb=0ifa=0ifa>banda,b=0ifb>aanda,b=0otherwise where a/2 and b/2 are integer divisions. Write a recursive function flip_flop(a,b) which implements the function f and returns a tuple ( f(a,b), count) where count is the number of recursive function calls. Note that count does not include the original call to the function For example