- Answer the following questions based on the graph below: a) List the nodes of the graph in alphabetical order using breadth-first traversal starting from vertex A. b) List the nodes of the graph in alphabetical order using depth-first traversal starting from vertex A. c) Find the shortest path distance from vertex A to G with its edge-weight sum using a graph with three fields vertex label, edge-weight sum/path length, and predecessor