Assuming that n is \"large enough\", expand the Fibonacci recurrence relation six times. HINT: The first expansion is F(n) = F(n - 1) + F(n - 2) and the second expansion is F(n) = F(n - 2) + 2F(n - 3) + F(n - 4). Solution fibonacci series is f(1)=0 f(2)=1 f(3)=f(1)+f(2); f(n+1)=f(n-1)+f(n+2).