Plan a trip starting in Chicago and visiting 11 cities. 1. Choose 11 cities in t

Plan a trip starting in Chicago and visiting 11 cities.
1. Choose 11 cities in the world that you would like to visit.
2. Draw using Sage a graph G = (V, E) with V being the set of all
12 cities and E representing the trip between two given cities (a plane
trip, a train trip, a boat trip, car trip.). Be sure you draw a complete
graph.
3. Is there a way to travel all edges in this trip? If so, draw using Sage
the path in red.
4. Is there a way to visit the chosen cities exactly once in this trip? If so,
draw using Sage the path in green.
5. Find distances between all cities.
6. Find prices of each trip between all cities.
7. Draw using Sage a weighted graph D representing distances and
another weighted graph P representing prices.
8. Approximate the shortest circuit visiting all cities exactly once.
9. Can you find the actual shortest circuit visiting all cities exactly once?
10. Approximate the cheapest circuit visiting all cities exactly once.
11. Can you find the actual cheapest circuit visiting all cities exactly once?
1
These notebooks are to be done in SageMath. Turn in the pdf output obtained from Sage.