The undirected graph in the diagram will be used to answer the two questions in this section. Please ignore the edge weights for these two questions. Also, don't let the geometry of the graph deceive you. You may not always go from a node high in the graph down to one lower in the graph. 1 2 2 10 m G 3 3 1 A 3 H K L M What is the order in which the nodes of the undirected graph are discovered in a depth-first search starting from node D? When you have the choice of two or more nodes according to the DFS algorithm, break ties by choosing the node whose label comes first in the alphabet. DBACGMFKLEIJH DBHIACEFGKLMJ DBACEKLMGEIJH ODHIEJBACFKLGM DIEJBACFKLGMH DBACFMGKLHIEJ DHIBJECAFGKLM What is the order in which the nodes of the undirected graph are discovered in a breadth-first search starting from node D? When you have the choice of two or more nodes according to the BFS algorithm, break ties by choosing the node whose label comes first in the alphabet. DBHIACEFGJKLM DBIHACEJFGKLM DBHIACEFGKLMJ DHIBACEFGJKLM DHIBAECJFGKLM DBACEKLMGEIJH