1. Prove that the closed form solution of the fibonacci equation: f(0)=0f(1)=1f(n)=f(n1)+f(n2) Is f(n)=51[(21+5)n(215)n] 2. Solve the recursive equation: T(1)=3T(n)=T(n/3)+n,n>1