Can $0/1$ knapsack problem be solved using the Greedy algorithm technique to obtain an

optimum solution to fill the knapsack?

$0/1$ knapsack problem $($This is the problem that we saw in the previous modules$)$ When

have $n$ items and their values given. We are provided with a knapsack of capacity $x.$ We

have only one copy of each item. We need to maximize the value of our knapsack with

items that we pick.

True

False