3. Suppose there are n items where each item i has a weight w; that is a positive integer In addition, we are also given a positive integer W. Design an algorithm that outputs “yes” if there is a subset of the n items whose total weight is W and “no” otherwise. What is the running time of your algorithm? (Hint: Take inspiration from the dynamic programming solution to the
OR
OR