Problem 3 (4 points]: Modeling Optimization Problems A taxi service provider (TSP) that owns N cars wants to build an intelligent system to automate and optimize the service it provides. The system allows passengers to request taxi service providing their current locations and their destination locations. The cars, on the other hand, could be located anywhere within the service area. The objective is to assign cars to passengers such that the average of the calculated fairs to be requested from passengers is minimized. For a passenger p and a car c, the total traveling distance in kilometers, denoted d(p, c), is defined as follows: d(p, c) = traveling distance form c's current location to p's current location (1) +traveling distance from p's current location to p's destination location. Let y be the average gas consumption rate (in L/Km) for car c, and 3 be the gas price in JD/L. For serving each request, the TSP calculates the requested fair as cost of consumed gas plus 1.5JD. In other words, the requested fair in JD) for serving passenger p with car c, denoted as f(p, c), is define as follows: f(p, c) = 1.5 + d(p,c). Y (2) Assuming that there are P passengers such that P <>