Question

# Suppose you are given an input set S of n numbers, and a target integer k, and want to find a subset of the

elements of S whose sum is exactly k. Further you are given a black box that if given any set of numbers C and integer t instantly and correctly answers true/false whether there is a subset of C whose sum is exactly t. Show how to use the black box O(n) times to find a subset of numbers of S that adds up to k.