(25+50 pts) Q.2 Cairo City Cab Company identified ten primary pickup and drop locations for cab drivers. To minimize travel time and improve customer service and utilization of the company's fleet of cabs, management would like the cab drivers to take the shortest path between locations whenever possible. Using the network below of roads and streets, answer the following. a. What is the shortest path that a driver can take to reach location 10 starting from location 1 ? Show the Dijasktra table [5pts] b. Find the minimum spanning tree that connects all locations, what is the cost? [5pts] ISEE 301 c. What is the maximum possible flow in the network [hintuse the min cut]? (Consider the numbers on arcs as the capacity of arc) [5pts] The company wants to utilize the network to supply some shops with items to increase their profit. The network is revised as below. Study the network and answer parts d and e. d. Write the mathematical model for the min-cost flow problem. [5pts] e. Using Cplex, find the optimal solution-Z: min cost and DVs. email your file. [50 pts-Lab]