Greatest common divisor (GCD of nonnegative integers x and y, is equal to x if y is zero otherwise it is equal to the GCD of y and x% y. (%is the remainder operator) ii. How many steps does it take find GCD(F_k, F_k-1) to terminate when the input parameters are the k^th and (k-1)^th Fibonacci numbers? (The Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13 ...) are defined by the recursive relation F_n = F_n - 1 + F_n - 2 with F_0 = 0, F_1 = 1) Explain your answer (or prove it)