Matt wins a "Magic the Gathering" trading card game tournament at his local game shop and is given two options as a prize:

Option A: 1 pack the first week, 3 packs the second week, 9 packs the third week, 27 packs the fourth week and so on for 6 weeks

Option B: 380 packs of the newest set of "Magic the Gathering" cards now.

Part A: To obtain the most packs after 6 weeks,

Matt should choose option A or B?

Part B: What is the difference in the total number of packs between

the two options?

Group of answer choices

Option A, and 364

Option A, and 16

Option B, and 16

Option B, and 380

Acaterer knows he will need 60, 50, 80, 40 and 50 dinner napkins on five successive evenings. he can purchase new napkins initially at 25 cents each, after which he can have dirty napkins laundered by a fast one-day laundry service (i. e., dirty napkins given at the end of the day will be ready for use the following day) at 15 cents each, or by a slow two-day service at 8 cents each or both. the caterer wants to know how many napkins he should purchase initially and how many dirty napkins should be laundered by fast and slow service on each of the days in order to minimize his total costs. formulate the caterer’s problem as a linear program as follows (you must state any assumptions you make): a. define all variables clearly. how many are there? b. write out the constraints that must be satisfied, briefly explaining each. (do not simplify.) write out the objective function to be minimized. (do not simplify.)