The Fibonacci numbers F; are defined as follows: if i is 1 or 2, Fi-1 + Fi-2 otherwise. What happens when you run Euclid's extended GCD algorithm on Fi and Fi+1 (This problem is asking not only for the answer but also about the execution of the algorithm.)