Given a set of items, each with a weight and a value, this program will determine the number of each item to include
in a bag so that the total weight is less than or equal to a given limit and the total value is as large as possible.
There are three ways to solve the problem with Greedy:
• 1: The most valuable first
• 2: The heaviest first
• 3: In a relationship between what it costs/weight
