Fibonacci numbers are a sequence of integers, starting with 1, where the value of each number is the sum of the two previous numbers, e. g. 1, 1, 2, 3, 5, 8, etc. write a function called fibonacci that takes a parameter, n, which contains an integer value, and have it return the nth fibonacci number. (there are two ways to do this: one with recursion, and one without.)

What is the next step in the given proof? choose the most logical approach. a. statement: m 1 + m 2 + 2(m 3) = 180° reason: angle addition b. statement: m 1 + m 3 = m 2 + m 3 reason: transitive property of equality c. statement: m 1 = m 2 reason: subtraction property of equality d. statement: m 1 + m 2 = m 2 + m 3 reason: substitution property of equality e. statement: 2(m 1) = m 2 + m 3 reason: substitution property of equality