Find K-Sum Subsets

Statement

Given a setA set is a collection of distinct objects. of $n$ positive integers, find all the possible subsets of integers that sum up to a number k.

Constraints:

• $1 \leq n \leq 10$ ...