Answer Happy

Consider the following graph: 5 6 Starting at vertex 1, what is the sequence of vertices visited in a depth-first-search traversal of the graph? Where there are multiple vertices to next traverse, select the vertex with the smallest label to visit next. The answers are the format of x,y,z, if the traversal visits x, then y, then z. O 1,2,6,4,5,3 O 1,2,6,5,3,4 O 1,3,5,4,6,2 O 1,6,2,4,5,3 O 1,2,4,3,5,6