1. Answer the following questions based on the graph below: a) b) c) A A 00 2 B D 5 4 2 F [13) [] E 2 N 2. 5 2 2 C List the nodes of the graph in alphabetical order using breadth-first traversal starting from vertex A. List the nodes of the graph in alphabetical order using depth-first traversal starting from vertex A. 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.