Suppose that a cybersecurity application requires to add up all the prime numbers with less than $100$ bits in a way that is close to$,$ but does not exceed, $2^{100}.$ An expert wants to use the Knapsack Dynamic Programming algorithm to accomplish this. How do you proceed?

The Knapsack algoh$$him does not work since the capacity C is too big

Let the values of the primes be weights and apply the Knapsack problem

$$ It is better to use the greedy algorithm and add primes in order of value as long as they don't exceed the capacity

$$ Instead of the Knapsack algorithm you should use the generalized knapsack