use python pls.

2. (40 points) Given the following graphs: Frankfurt 85 km217 km 73 km Frankfurt Mannheim Stuttgart 0 km 86 km 103 km 483 km Kassel Mannheim Wrzburg Kassel Karlsruhe Erfurt Karlsruhe Nnberg Erfurt Mnchern 50 km 2 km Augsburg 67 km AugsburgStuttgart 4 km Mnchern Graph A Graph B 2a. Write the names of the vertices (cities) in the order you would visit them if you performed a breadth-first traversal of Graph A, starting with the vertex named Frankfurt. 2b. Write the names of the vertices (cities) in the order you would visit them if you performed a breadth-first traversal of Graph B, starting with the vertex named Frankfurt. 2c. Write the names of the vertices (cities) in the order you would visit them if you performed a depth-first traversal of Graph A, starting with the vertex named Frankfurt. 2d. Write the names of the vertices (cities) in the order you would visit them if you performed a depth-first traversal of Graph B, starting with the vertex named Frankfurt. Note that Graph A is undirected and Graph B is directed. You may ignore any weights on edges. Submit your solutions to Problem 2 as comments in the "hw6.py" file that also contains your solution to