. Estimate the speed up of the dynamic programming bottom-up evaluation of the Fibonacci code compared with the previous recursive version. How many times faster is the new code? It may be advisable...

. Estimate the speed up of the dynamic programming bottom-up evaluation of the Fibonacci code compared with the previous recursive version. How many times faster is the new code? It may be advisable not to call the previous version with a value much higher than 30 or so.