i need correct solution please dnt copy past

Question2: (5 marks) The EA on Fibonacci numbers: Let {Fn} be a sequence of numbers such that for n > 3: Fn = Fn-1 + Fn-2 where: F1 = 1 and F2 = 1. Prove that T(Fn+2, Fn+1) = n using mathematical induction. Show the basis step, the inductive hypothesis, and the inductive step. Question2: (5 marks) The EA on Fibonacci numbers: Let {Fn} be a sequence of numbers such that for n > 3: Fn = Fn-1 + Fn-2 where: F1 = 1 and F2 = 1. Prove that T(Fn+2, Fn+1) = n using mathematical induction. Show the basis step, the inductive hypothesis, and the inductive step