Solution to the 0-1 Knapsack problem using a Greedy approach.