Question3: (5 marks) The minimum size for a and b: Prove that if T(a,b) = n, then a > Fn+2 and b > Fn+1 using mathematical induction. Show the basis step, the inductive hypothe- sis, and the inductive step. In other words, prove that if the EA takes n steps to compute GCD(a,b) where a > b, then a cannot be smaller than Fn+2 and b cannot be smaller that Fn+1