*JAVA* 7. Consider the Fibonacci numbers: F(n) = F(n 1) + F(n 2), n > 1; F(1) = 1; F(0) = 0.

c) (optional for bonus credit) Write a recursive function/procedure to compute F(n) with time complexity O(log(n)) (more precisely, the time complexity should be O(log(n)A(n)) when n is large, where A(n) is the complexity of adding or multiplying F(i) and F(j)). n-1 Hint : G(n) = ( 1 ) (n- G(n 1) = (1 :)" G(1), n>1