Question 7: Graphs Traversals: DFS, BFS [10]

Answer both questions using the graph below, assuming all edges are bidirectional.

(i) Show an order in which the nodes could be processed using a breadth-first traversal starting from node A.

(ii) Show an order in which the nodes could be processed using a depth-first traversal starting from node C.

G---A---D---F     
    |    \  |
    |     \ |
    |      \|
C---B-------E