Good morning. This is a Recursion and the 0-1 Knapsack Problem. I have been trying to figure out how to solve this problem. However, it shows me that I have too many errors. Could you please help me with this problem. It is also related to Operation Management. It will be great if you could comment while developing the problem. It will help me to understand the process that you are using (follow you). Thank you

Question Consider the following optimization problem: max s.t.