A transportation network has 10 nodes. Distances between nodes are shown in Table 1. Total five emergency vehicles are located at nodes 2, 4, 5, 7, and 9. There is one vehicle at each of these five nodes. The vehicles must travel to destination nodes 1, 3, 6, 8 and 10. Each destination node will have one vehicle. Suppose that emergency vehicles may travel along both directions of any road shown in Table 1. Please apply the Dijkstra's algorithm and Hungarian method to minimize the total travel distance of the five vehicles. A transportation network has 10 nodes. Distances between nodes are shown in Table 1. Total five emergency vehicles are located at nodes 2, 4, 5, 7, and 9. There is one vehicle at each of these five nodes. The vehicles must travel to destination nodes 1, 3, 6, 8 and 10. Each destination node will have one vehicle. Suppose that emergency vehicles may travel along both directions of any road shown in Table 1. Please apply the Dijkstra's algorithm and Hungarian method to minimize the total travel distance of the five vehicles