If it is possible I would like to see how to implement this in Python.

Problem 3: (10 points) 0-1 Knapsack: Recursive vs DP Given weights and values of n items, select items to place in a knapsack of capacity W to maximize the total value in the knapsack. That is, given two integer arrays val[] and wt[] which represent values and weights associated with n items respectively and an integer W which represents knapsack capacity, determine the maximum value subset of val[] such that sum of the weights of this subset is