Solve using Ampl only , not just formulation but complete answer. with AMPL code

*9-19. ABC is an LTL (less-than-truckload) trucking company that delivers loads on a daily basis to five customers. The following list provides the customers associated with each route: Route Customers served on the route 1 1 1, 2, 3, 4 2 4,3,5 3 1,2,5 4 2,3,5 5 1,4,2 6 1,3,5 The segments of each route are dictated by the capacity of the truck delivering the loads. For example, on route 1, the capacity of the truck is sufficient to 353ver the loads to customers 1,2,3, and 4 only. The following table lists distances (in miles) among the truck terminal (ABC) and the customers: Miles from i toj ABC 1 2 3 5 ABC 1 2 0 10 12 16 9 8 10 0 32 8 17 10 12 32 0 14 21 20 16 8 14 0 15 18 9 17 21 15 0 11 8 10 20 18 11 0 5 The objective is to determine the least distance needed to make the daily deliveries to all five customers. Though the solution may result in a customer being served by more than one route, an approximation in the implementation phase assumes that only one such route is used. Formulate the problem as an ILP, and find the optimum solution