B) H Graph X is given above. Assume that the nodes in the adjacency list of each vertex are listed in the alphabetical order. (a) What is the sequence of vertices on the path to vertex G from vertex A when graph X is traversed using BFS with source vertex as A? (b) If you want to find the path from vertex A to vertex H using DFS on X, what is the sequence of vertices visited? (C) Suppose we perform DFS on X starting at vertex A. For each edge, specify if it is a tree edge or a back edge. Write your answer as XY - tree/back where XY is an edge. B) H Graph X is given above. Assume that the nodes in the adjacency list of each vertex are listed in the alphabetical order. (a) What is the sequence of vertices on the path to vertex G from vertex A when graph X is traversed using BFS with source vertex as A? (b) If you want to find the path from vertex A to vertex H using DFS on X, what is the sequence of vertices visited? (C) Suppose we perform DFS on X starting at vertex A. For each edge, specify if it is a tree edge or a back edge. Write your answer as XY - tree/back where XY is an edge