Shortest-Route Problem. Imagine a map with cities connected by roads. Each road has a distance associated with it, representing the travel distance between two cities (given below). Illustrate the model then find the shortest route from City A to City E using the given road distances.
Cities: A, B, C, D, E
Roads and Distances:
A to B: 5 units
A to C: 3 units
B to C: 2 units
B to D: 4 units
C to D: 1 unit
C to E: 7 units
D to E: 6 units