please solve this question

Problem 3 (10 points) The Knapsack decision problem has the following description: Input: N objects each with a value v; and a weight w; and two numbers W and V. All numbers are integers. Output: YES/NO, depending on whether there exists a subset of the objects whose sum of weights V. . Suppose you have a black box for the decision problem. Show how to solve the 0-1 knapsack problem (search version) described below: Input: N objects each with a value v; and a weight w; and a number W. All numbers are integers. Output: The set of objects that achieve the maximum value without exceeding the knapsack capacity W