Displaying Subsets whose elements add up to a particular sum

#1

QUESTION:
Sum It Up

You are given an array of numbers and a target number(T) , print all unique combinations in the array whose sum equals the target number T. Note that each number in the array may only be used once in the combination.
Note:

All numbers (including target) will be positive integers
Elements in the combination must be in non-descending order
There should be no duplicate combinations

DOUBT:
Can we implement this using the function which determines whether a subset of an array add up to a certain sum or not? Also help me with the function code

#2

you can do it by recursion and backtracking.

even if you find a function which determines whether a subset of an array add up to a certain sum or not?, then how will you find exact sequence of numbers? this can’t be an approach, approach by trying to form a sequence through brute force