Sally is hosting an Internet auction to sell n widgets. She receives m bids, each of the form "I want ki widgets for di dollars," for i = 1, 2, . . . , m. Characterize her optimization problem as a knapsack problem. Under what conditions is this a 0-1 versus fractional problem?