Program a bottom-up dynamic programming solution of the knapsack problem...

PLEASE USE PYTHON

PLEASE PROVIDE COMMENTS AND EXPLANATION

data.txt (example)

3 25

2 20

1 15

4 40

5 50

Consider the following instance of the knapsack problem with capacity W = 6 Item Weight Value $25 $20 $15 $40 d) Implement the bottom-up dynamic programming algorithm for the knapsack problem. The program should read inputs from a file called "data.txt", and the output will be written to screen, indicating the optimal subset(s)