Question

Find the smallest positive integer value that cannot be represented as the sum of any subset of a given array.
a)Greedy algorithm
b)Dynamic programming
c)Backtracking approach
d)Brute-force method