(a) Given a multiset S = {x1,..., xn} of n integers and an integer k, determine whether there is a subset of S whose members sum to exactly k. (You can assume that any individual operation on integers...

A2

Extracted text: (a) Given a multiset S = {x1,..., xn} of n integers and an integer k, determine whether there is a subset of S whose members sum to exactly k. (You can assume that any individual operation on integers [addition, comparison, etc.] takes O(1) time).