Solve the 0-1 Knapsack using a backtracking algorithm in Python -- 2

Hey, I wanted the 0-1 Knapsack problem solved by using a backtracking algorithm. I already have the pseudocode, I just can't figure out how to write it in Python. Let me know if it's something you can help with. I have attached the pseudocode.