We stated the Subset-Sum problem as: Given n natural numbers and an integer W, is there a subset that adds up to exactly W? We stated the Knapsack problem as: Given a set of X items, weights _0, _0, a weight limit U and a target value V, is there a subset such that

Question: To prove Subset-Sum _Knapsack, can you create an instance of Subset-Sum and show how to reduce it to an instance of the Knapsack problem? Please use the same notation as above

iSuiU,iSviV iSuiU,iSviV