The following is an instance of the knapsack problem. The capacity is 10.

item weight value

1. 1 20

2 2 30

3 3 66

4 4 40

5 5 58

3.1 Use the dynamic programming algorithm to solve the above knapsack problem. Please show the table, in which each cell contains the item number or numbers, total weight, and total value.

3.2 Use a greedy algorithm to solve the above knapsack problem.