1. Prove that the fractional knapsack problem has the greedy choice property. This means that the locally-optimal choice (the item with highest value per weight) is the globally optimal choice.

2. Suppose that in an instance of the 0-1 knapsack problem, the order of items when sorted by increasing weight is the same as the order when sorted by decreasing value. Give an efficient algorithm to solve this version of the knapsack problem.