You have to rename your answer script as your_id.pdf. Make sure it is readable. Make sure you have cover-page (only name and ld is required). If not all 3 maintained it is rejected. Late submissions will be rejected. 1. Write the recursive algorithm taught in class to find the longest common subsequence. For the following generate a recursion tree. b g b VO g a h 10 [10] 2. Is Dynamic Knapsack better than greedy explain. [5]