3. (9 pts) Given a set of n integers, say, an array of nums[i], i = 0, 1, ..., n-1, and given a target integer t, we would like to know if there exists a subset of this array, and the elements in this subset sum to t. For example, nums[i] = {5, 3, 1, 2, 7}, and t = 11, so the answer is true, since 3+1+7 =11. Briefly describe how to map this problem to the 0/1 Knapsack problem (NO need to write code), so the dynamic programming solution we discussed in the class can be readily used to solve this