Please show me how to solve the problem with AMPL!

1-5. A group of young entrepreneurs earns a (temporarily) steady living by acquiring inadequately supervised items from electronics stores and re-selling them. Each item has a street value, a weight, and a volume; there are limits on the numbers of available items, and on the total weight and volume that can be managed at one time. (a) Formulate an AMPL model that will help to determine how much of each item to pick up, to maximize one day's profit. (b) Find a solution for the case given by the following table, and by limits of 500 pounds and 300 cubic feet. (c) Suppose that it is desirable to acquire some of each item, so as to always have stock available for re-sale. Suppose in addition that there are upper bounds on how many of each item you can reasonably expect to sell. How would you add these conditions to the model? (d) How could the group use the dual variables on the maximum-weight and maximum-volume constraints to evaluate potential new partners for their activities? (e) Through adverse circumstances the group has been reduced to only one member, who can carry a mere 75 pounds and five cubic feet. What is the optimum strategy now? Given that this requires a non-integral number of acquisitions, what is the best all-integer solution? (The integrality constraint converts this from a standard linear programming problem into a much harder problem called a Knapsack Problem. See Chapter 20.)