Green Energy Relаy – A Jоurney Tоwаrd Chаnge Tо raise awareness for renewable energy and sustainable living, a team of passionate eco-activists is preparing to embark on a cross-state relay run. Their journey begins in City 1, where the opening ceremony takes place, and concludes in City 10, the state capital, where a rally is scheduled to draw media attention. Each team member will run a portion of the route, passing a symbolic “green torch” from city to city. The transportation network between cities is complex. Roads are not always accessible in both directions, and the terrain varies, impacting distances between cities. The available routes and the mileage between each pair of connected cities are shown in the network diagram below. In this diagram, cities are represented by numbered circles, and arrows represent roads. A single-headed arrow indicates a one-way road, meaning the team can only travel in the direction of the arrow. A double-headed arrow indicates a bi-directional road, meaning the team can run in either direction, and the mileage is the same both ways. Distances are indicated by the numbers shown next to each arc and are measured in miles. The goal is to plan the most efficient path for the team. Since their mission is time-sensitive and physically demanding, they aim to minimize the total distance traveled while successfully reaching their destination. Question - Under the current conditions: What is the minimum total distance the team must travel to get from City 1 to City 10? [org_dist] miles What is the best route for the team to take? (For example: 1, 2, 3, 4, 10) [org_path] However, midway through planning, the team receives an exciting update: a well-known politician, who strongly supports their cause, is visiting City 5. Meeting this figure could generate significant public and media attention. Now, they must decide how to adjust their route to include a stop in City 5—without significantly extending the journey. What is the minimum total distance they must travel while ensuring a visit to City 5? [rev_dist] miles What is the best route they should take that includes a stop in City 5? (For example: 1, 2, 3, 4, 10) [rev_path]