2. The K-Median and Max-Covering Problems: Trust Inc. makes deliveries to its customers, which are located in 6 clusters. The table below provides the driving times (in hours) between 5 potential warehouse locations (labeled 1 through 5) and the 6 customer clusters (labeled A through F). Travel is limited to the road network. Travel time between warehouses and customers: Number of customers per cluster: a. The VP of Logistics is primarily concerned with transportation costs to customers. Assuming a transportation rate that is linear with travel time, which problem would we solve to choose 1 location which would minimize the total transportation cost? b. Solve the problem using the method you've identified in part a. What is a good location? c. The VP of Finance, instead, suggests a solution that maximizes the number of customers that are within 15 hours but does so with only 2 warehouses. Which problem would we solve to give this VP an appropriate solution? d. Solve the problem using the method you've identified in part c. What are good locations