Dynamic Programming, Recursion, Python, Coding Tutorial, Python Programming.
list of weights and a list of costs, find the optimal subset of things that form the highest cumulative price bounded by the capacity of the knapsack. You should not change the signature of the given function; however, you may create a new function with a different signature and call it from the