Consider a backpack (or "knapsack") that can hold up to a specified amount of weight. You have a set of items each having a unique value and unique weight.

Given this information, write an algorithm that fills the backpack with the most valuable items within the backpack's capacity. Below is an example:...