[-/11 Points] DETAILS TEAFM2 3.1.020. Formulate a linear programming problem that can be used to solve the following question. An airline has three types of airplanes and has contracted with a tour group to provide transportation for a minimum of 78 first-class, 60 tourist, and 114 economy-class passengers. The first plane cost $3600 for the trip and can accommodate 36 first-class, 16 tourist, and 26 economy-class passengers; the second plane costs $4800 for the trip and can accommodate 14 first-class, 16 tourist, and 40 economy-class passengers; the third plane costs $5500 for the trip and can accommodate 18 first-class, 30 tourist, and 16 economy-class passengers. How many of each type of airplane should be use to minimize the operating cost? x= ---Select--- y = --Select--- z= ---Select--- ---Select-- F= Subject to (objective function) (first-class passengers) (tourist passengers) (economy-class passengers) x---Select---0, y ---Select---0, z ---Select---0 (nonnegativity constraint) Additional Materials