1. Using vertex 'd' as the starting vertex, perform DFS traversal on this graph. Clearly mark each edge as follows: - discovery edge: highlight in bold - back edge write 'b' next the edge At the end, list the vertices in order visited.

2. Using vertex 'd' as the starting vertex, perform BFS traversal on this graph. Clearly mark each edge as follows:

- discovery edge highlight in bold. - cross edge: write 'x' next the edge At the end, list the vertices in order visited.

Transcribed Image Text:

Consider the following graph G3 when answering questions 6 and 7: Consider the following graph G3 when answering questions 6 and 7: