Consider the graph G = , with, V = {A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q}. W = {(A,B), (A,C), (A,D), (B,C), (C,D),(D,E), (E,F), (E,H), (E,I), (F,G), (F,H), (F,I), (G,H), (G,I) (I, J), (J,K), (J,L), (J,M), (J,N), (J,Q), (K,L), (K,M), (K,N), (K,Q), (L,M), (L,N), (L,Q), (M,N), (M,Q), (N,Q)}

Modify G into a new graph H, by adding the edges {(I,K), (I,N), (C,E), (D,G), (K,O), (K,P), (M,O), (P,Q)}.

Show a Breadth-First Search (BFS) traversal (tour) of H, starting from node A

Show a Depth-First Search (DFS) traversal (tour) of H, starting from node K