[Solved]1 15 Pts Implement Recursive Memoized Dynamic Programming Fibonacci Study Performances Usi Q37204716

1. (15 pts) Implement recursive, memoized, and dynamic programming Fibonacci and study their performances using different problem instances. You can choose to look at the perfor- mance by either timing the functions or counting the basic operations (in code) Provide your results below, and submit your code. Also, describe the pros and cons of your choice of performance metric Note: If you decide to use timing, the standard way to tme an algorithm is to run the same problem 100 or 1000 times (use a loop), getting the overall running time (get the start time, run the same test 1000 times, get the end tme), and averaging over the number of runs. You should not try to time an ndividls You may find that algorithms that run faster need to have more repetition whereas algorithms that run slower need fewer repetitions. Be careful when running mor hanne memoized Fibonacci, as the dictionary should be reset each time, 2. (10 pts) Fill in the LCS matrix for CCGGTTACCA and GGAGTTCA using the LCS algo- rithm given in class, and provide the actual longest common subsequence Show transcribed image text 1. (15 pts) Implement recursive, memoized, and dynamic programming Fibonacci and study their performances using different problem instances. You can choose to look at the perfor- mance by either timing the functions or counting the basic operations (in code) Provide your results below, and submit your code. Also, describe the pros and cons of your choice of performance metric Note: If you decide to use timing, the standard way to tme an algorithm is to run the same problem 100 or 1000 times (use a loop), getting the overall running time (get the start time, run the same test 1000 times, get the end tme), and averaging over the number of runs. You should not try to time an ndividls You may find that algorithms that run faster need to have more repetition whereas algorithms that run slower need fewer repetitions. Be careful when running mor hanne memoized Fibonacci, as the dictionary should be reset each time, 2. (10 pts) Fill in the LCS matrix for CCGGTTACCA and GGAGTTCA using the LCS algo- rithm given in class, and provide the actual longest common subsequence

Expert Answer

---

Answer to 1. (15 pts) Implement recursive, memoized, and dynamic programming Fibonacci and study their performances using differen… . . .