can you prove that the running time of fib3 is o(m(n))? (hint: the lengths of the numbers being multiplied get doubled with every squaring.)