3- Flased 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. - What is the maximum profit that can be obtained? b- What are the items and fractions that must be taken? Water 40 50 . 70 4- Based on your understanding of the longest common subsequence problem, write a dynamic programming code to solve the problem asing 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