2. Seven patients require blood transfusions. We assume four blood types: A, AB, B, and O. Type AB is called the universal recipient; type O is called the universal donor. The blood supply and patient data is as follows: Type Supply Cost per pint Patient Blood Type Need (pints) A 7 pints AB 6 pints AB 4 pints 0 5pints The problem is to ensure that each patient receives the required amount of the proper type of blood and to use the existing supply so that the cost of replacement is minimized. Formulate this as a linear programming problem. Label the decision variables, objective function, and constraints. Then solve it using the simplex method. 2. Seven patients require blood transfusions. We assume four blood types: A, AB, B, and O. Type AB is called the universal recipient; type O is called the universal donor. The blood supply and patient data is as follows: Type Supply Cost per pint Patient Blood Type Need (pints) A 7 pints AB 6 pints AB 4 pints 0 5pints The problem is to ensure that each patient receives the required amount of the proper type of blood and to use the existing supply so that the cost of replacement is minimized. Formulate this as a linear programming problem. Label the decision variables, objective function, and constraints. Then solve it using the simplex method