0-1 knapsack problem

#1

please help cant understand how to do it

#2

@Learning_bunny think this way -
for every element you can either add to your bag(if your bag can hold it) or you can ignore this element and move to next element. Try to implement recursive solution to this with memoization