Using DP for knapsack problem

Can this be solved with dp, if yes, can you provide me with a solution, it is in recursion section in the course, also, would greedy work?