Constructing a DFS tree traversal. see instructions

Given the following graph "construct" the DFS tree traversal of the graph starting at A. Special Convention: if you have two or more choices always select the "lesser" choice. For example if you have the choice of going to F and going to B, select B first. A B E D C F G Instructions for answering this question: Suppose your tree is like the following one: 1 2 3 4 5 7 6 8 Then you would fill up the table like this, remember to write a hyphen (-) into the empty cells: 1 2 4 6 3 5 7 8 Fill up the following table using the instructions from above showing your DFS Tree