C++

Consider the directed graph shown in Figure 6. D G Figure 6: Directed Graph (a) Draw the adjacency matrix and adjacency list for the graph. (b) If a depth- first traversal were performed starting at vertex A, and visit are to be made in alphabetical order by vertex name where possible, in what order would vertices be visited? Draw appropriate diagram to show how you get the result