Hi, i would like to know the solutionsfor the following questions which were asked in Adobe test..

-questions using finite automata
optimise the computations in the recursive "nth fibonacci number" algo without using iteration(fairly simple)
"Instead of using return(fib(n-2)+fib(n-1)), use init lofib=0,hifib=1, start with n=2,lofib=hifib;hifib=fib;fib=lofib+hifib"

i am not very clear abt the solution that was given ...

thanks