Questions 3: Induction and recursion Consider the definition of Fibonacci series: where Fo = 0, F1 = 1, F2 = 1, and the recursive term is defined as Fn+1 = Fn+Fn-1. Given these, prove F1+F3 + F5 + ... + F2n-1 = F2n using mathematical induction