C++

Please provide screenshot of the output

he knapsack problem is that given a set of positive integers fa,,an), and a knapsack of size s, find a subset A of (a1,,an) such that the sum of elements in A is the largest, Problem 3. (50%) T but at most s. ntanom the or your algorithm. carefully. Part 2. Use C++ to implement the function below int knapsack( int *a, //the input integers int n, //the number of input integers int s, //knapsack size int "subset, //subset elements int ksize.of subset//the number of items in the subset Test your program for the following knapsack problem: Input list: 147. 153, 159, 171, 181, 190, 91 with knapsack elements so that the sum has the closest distance to 595. Also print out 5, 23, 27, 37, 48, 51, 63, 67, 71, 75, 79, 83, 89, 91, 101, 112, 121, 132, 137, 141, 143, size 595. Print out a subset with the sum of its