Darrin is putting together gift bags. The selections of gifts he can include are shown in the table. The table is titled Gift Bags. The table has three columns and two rows. The first column is labeled Stickers, the second column is labeled Key Chain, and the third column is labeled Candy. The first row is labeled Gift Card and the second row is labeled Game. The numbers in the first row are four, eight, twenty-two. The numbers in the second row are seven, fourteen, five. Part A Select all the possible combinations of gifts that Darrin might put in each bag.

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.)