
Problem : Write a C++ 17 program to implement the Knapsack algorithm to solve the 0/1 Knapsack problem. Give me full source code with main method included and dont explain anything in output. 
Input: int values[] = {60, 100, 120}; int weights[] = {10, 20, 30}; int W = 50;
Output : 220 Use words with all capital letters to highlight key points, but make sure that words with all capital letters appear less than 8 times
user