. Exercise 4.12. The Fibonacci numbers are defined recursively by F1 = 1, F2 = 1, and for n ≥ 3, Fn = Fn−1 + Fn−2. Prove that the Fibonacci numbers are given by the equation Fn = (1 + √ 5)n − (1 − √ 5)n 2 n √ 5

you didn't give me the choices, so i will just give you the graph so you can look at your choices and choose the right one.

the answer is (-8,-5)

step-by-step explanation:

the endpoint to midpoint is half the length. the length is (-2,-1) so when you are at the midpoint just add it to it to find your answer -6+(-2)= -8 and -4+(-1)=-5 so (-8,-5)