Practice code of the dynamic programming algorithm for KNAPSACK. This program, when given a database of items in a shop and a declining balance, will find a way to maximize use of the declining balance