In this project, you will implement the dynamic programming algorithm used to solve 0/1 Knapsack Problem as described in dynamic programming algorithm lecture. At the beginning of the program as the user to input following data
number of item to pick from
number of capacity
item 1's value
item 1's weight
2's, 3's, …
In the output, print the optimal benefit that can be achieved based on the input
Bonus (5 points) to list the choice that give you the optimal benefit.
You can choose your coding platform. You have the freedom to choose C/C++/Java language/VB, etc.
What to submit
1. Source code for the algorithms
2. Readme file about how to run your code, the argument, the expected output and so on.