Problem $3($Matching$)$ Formulate the following problem into an integer linear programming model to

minimize the total waiting time of customers.

The Yellow Cab of Irvine has a taxi waiting at each of four cab stands around the city. Four

customers have called and requested service. The distance, in minutes, from the waiting taxis

to each of the customers is given below:

Formulate and solve an LP model. Please define your decision variables, objective function and

constraints and label your constraints clearly. You need to show your work in problem formulation, and

its implementation in Excel, and use Solver to find the optimal solution.