3) Solve the following linear programming model graphically: (40 Points) minimize Z=10x1 - 3x2 subject to: 5x1 - 4x2 >-20 X1/X2 10 X1, X2 > 0 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 $2 $5 $5 Day Night $9 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: Day Night Phone (min.) Personal (min.) 18 10 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)