please include the screenshots of input and output along with the code.

2. Find an optimal solution to the knapsack instance n,m, (p1,p2,p3,,pn), and (w1,w2,w3,,wn). Greedy strategy to get the optimal solution is to consider the objects in order of nonincreasing density. Arrange the objects according to insertion sort before applying greedy technique. Write a program in C or C++ to get the optimal solution