5. (8 points, 2 points each Given the below set of figures between US airports apply the specified algorithms. Fill in the tables that have the layouts identical to the samples provided below, including airport ordering, so that it is easier for the TA to grade them. JFK LAX MIA ORD BOS BWI DFW PVD SFO 1258 867 2704 BOS BWI 302 1391 1235 1121 DFW 1464 FK 187 184 1391 1090 740 144 2342 LAX 1235 337 1121 1090 1258 946 2342 MIA 867 621 802 740 849 1846 ORD PVD 337 2704 1464 1846 SFO a. Assuming the numbers are miles, provide a Dijkstra table for the shortest paths from MLA. b. Assuming the numbers are miles, provide a Prim's table for the minimum spanning tree starting from SFO c. Assuming the numbers are miles, provide the Union by Size table for Kruskal s. When two trees have the same size, have the airport with the smaller index be the new root. d. Assuming the numbers are the number of people possible to carry between cities, apply Ford-Fulkersons to determine the number of people that can get from SFO to JFK. If two edges with same possible remaining flow are available at the same time, select the edge that starts from an airport closer to the beginning of the alphabet. 5. (8 points, 2 points each Given the below set of figures between US airports apply the specified algorithms. Fill in the tables that have the layouts identical to the samples provided below, including airport ordering, so that it is easier for the TA to grade them. JFK LAX MIA ORD BOS BWI DFW PVD SFO 1258 867 2704 BOS BWI 302 1391 1235 1121 DFW 1464 FK 187 184 1391 1090 740 144 2342 LAX 1235 337 1121 1090 1258 946 2342 MIA 867 621 802 740 849 1846 ORD PVD 337 2704 1464 1846 SFO a. Assuming the numbers are miles, provide a Dijkstra table for the shortest paths from MLA. b. Assuming the numbers are miles, provide a Prim's table for the minimum spanning tree starting from SFO c. Assuming the numbers are miles, provide the Union by Size table for Kruskal s. When two trees have the same size, have the airport with the smaller index be the new root. d. Assuming the numbers are the number of people possible to carry between cities, apply Ford-Fulkersons to determine the number of people that can get from SFO to JFK. If two edges with same possible remaining flow are available at the same time, select the edge that starts from an airport closer to the beginning of the alphabet