Question: I need a java code. The Problem. You are given an integer K (size of your knapsack) and n items of varying sizes such that

I need a java code.
The Problem. You are given an integer K (size of your knapsack) and n items of varying sizes such that the ith item has sizek, Find a subset of these items whose sizes sum to K, or else determine if no such subset exists
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
