1) The Mill Mountain Coffee Shop blends coffee on the premises for its customers. It sells three basic blends in 1-pound bags, Special, Mountain Dark, and Mill Regular. It uses four different types of coffee to produce the blends-Brazilian, mocha, Colombian, and mild. The shop has the following blend recipe requirements: Selling Price / Pound $ 18 Blend Special Dark Regular Mix Requirements At least 40% Columbian, at least 30% mocha At least 60% Brazilian, no more than 10% mild No more than 60% mild, at least 30% Brazilian $ 10 $ 25 The cost of Brazilian coffee is $2.00 per pound, the cost of mocha is $2.75 per pound, the cost of Colombian is $2.90 per pound, and the cost of mild is $1.70 per pound. The shop has 90 pounds of Brazilian coffee, 50 pounds of mocha, 90 pounds of Colombian, and 225 pounds of mild coffee available per week. The shop wants to know the amount of each blend it should prepare each week to maximize profit. Formulate a linear programming model for this problem. (30 Points) 2) The United Charities annual fund-raising drive is scheduled to take place next week. Donations are collected during the day and night, by telephone, and through personal contact. The average donation (in dollars) resulting from each type of contact is as follows: Phone Personal $9 AA UN Day Night $2 $5 $5 The charity group has enough donated gasoline and cars to make at most 300 personal contacts during one day and night combined. The volunteer minutes required to conduct each type of interview are as follows: Phone (min.) Personal (min.) Day 18 10 Night 25 45 The charity has 10 volunteer hours available each day and 45 volunteer hours available each night. The chairperson of the fund-raising drive wants to know how many different types of contacts to schedule in a 24-hour period (i.e., 1 day and 1 night) to maximize total donations. Formulate a linear programming model for this problem. (30 Points)