Fibonacci sequence is dehned as F(n)=F(n1)+F(n2);F(1)=1 and F(0)=0 Consider the following two implementations of this function. Which one would you use if your goal is to use a faster algorithm? Implementation 1: fibi(a)ifn=0return0ifn=1:returm1returnfibi(n1)fibi(n2) Implementation 2: Implementation 1 None of the options Any one of the two, both have same time complexity Implementation 2.