Unlimited units of following items are available. Item Weight per unit (lbs) Price per unit ($) 1 4 11 2 3 7 3 5 12 We wish to fill a 10 pound bag with items of maximum total price. Any number of units of an item can be used. In particular, we can select multiple units of the same item if we want. Formulate the integer program and find out the maximum total price of all items in the bag. Note that this problem can also be solved using dynamic programming by slightly modifying the algorithm discussed in the lecture.