Please give detailed solution because I am super confused

2. For 0-1 Knapsack problem, the following table shows four items, their values and weights. The maximum weight capacity of the knapsack is 5. item ( 12 3 4 value (val [])304050 60 weight (wt [])2 3 4 5 a) (6 marks) Use the dynamic solution of 0-1 Knapsack problem to populate the following table. 1-00 000 0 0 b) (2 marks) What could be the maximum value of the knapsack? (Answer from the last table) c) (2 marks) What are the most valuable set of items that fit in the knapsack