Question: 7. Suppose a computer using brute force to solve the knapsack problem can check a billion subsets per second. If there are 40 things

7. Suppose a computer using brute force to solve the knapsack problem can check a billion subsets per second. If there are 40 things in total (e.g. 40 experiments to be considered) how long will it take to check each subset? What if there are 50?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
