(Choose 1 answer)
Using depth-first search to produce a spanning tree for the given simple graph.and assume that the vertices are ordered alphabetically. Choose the vertex A as the root of this spanning tree. What is the spanning tree that we obtain?
A. (i)
B. (iv)
C. (iii)
D. None of the other choices is correct
E. (ii)
AQ
(i)
AO
A Q
CO
OE
(iii)
<
vat
fini
Finish
Exll
18
