Please solve As soon as

In exam i have only 15min

Solve quickly i get you thumbs up directly

Thank's

Abdul-Rahim Taysir

Assignment 1- Mention three differences between greedy algorithms and dynamic programming? 2- Mention all the design techniques/paradigms covered in our course. 3- Based on your understanding of the fractional knapsack problem, assume that you have 7 items with the following values and weights. The total Knapsack weight is 15. a-What is the maximum profit that can be obtained? b- What are the items and fractions that must be taken? Heuber We 40 4 SO 10 3 + H 5 6 2 20 15 4. Based on your understanding of the longest common subsequence problem, write a dynamic programming code to solve the problem using C++. Your code must process two sequences (arrays) of type character and return the longest common subsequence between them and its length. Hint: You can refer to the pseudo code in the slides