1. Another problem that falls in the NP-complete category is the knapsack problem, which is the problem of finding which numbers from a list are the ones whose sum is a particular value. For example,...

1.
Another problem that falls in the NP-complete category is the
knapsack problem,
which is the problem of finding which numbers from a list are the ones whose sum is a particular

value. For example, the numbers 257, 388, and 782 are the entries in the list 642 257 771 388 391 782 304 whose sum is 1427. Find the entries whose sum is 1723. What algorithm did you apply? What is the complexity of that algorithm?