**Problem Statement:** Given weights and values of `n` item…

**Problem Statement:**
Given weights and values of `n` items, put these items in a knapsack of capacity `W` to get the maximum total value in the knapsack. You can either include an entire item or exclude it.