this question is algorithm.

question : Design an algorithm for the following problem: During a robbery, a burglar findsmuch more loot than he had expected and has to decide what to take. His knapsack willhold a total weight of at most W pounds. There are n items to pick from, of weightwl, wWa and valuc vl,...., Find out the most valuable combination of items he canfit into his bag.(Each item is unlimited of quantity).