Based on the following adjacency list representation of a graph (where there are no weights assigned to the edges), draw the BFS tree (vertices and tree edges) that results when performing a BFS traversal starting at node D, also draw the DFS tree that results when performing 

 

a DFS traversal starting at node E.

 

A: C, H

 

B: C, F, H

 

C: A, B, D, E

 

D: C, E, G

 

E: C, D, F

 

F: B, E

 

G: D, H

 

H: A, B, G