These questions go hand-in-hand. Please show work and your thoughts behind this. Thank you.

(Fn+1 Show that A"= Let En denote the nth Fibonacci number. Let A= (1 o) Fm Fn-1). 2. (Hint: use induction) 3. Use the equality proven in question 2 to design an algorithm to compute the nth Fibonacci number in O(log n) time