Write a c/c++ program to solve the knapsack problem using one of these different approaches/implementations: dynamic programming or branch-and-bound. The program is to read a text file named "items.txt" where the first line contains, in order, the number of items and the capacity of the knapsack, followed by a line for each item containing, in order, the weight of the item and the value of the item. The program is to output the total weight and value of the knapsack along with the list of items selected for the knapsack.