Create a spanning tree using the Depth$-$First search algorithm.$$Start at vertex $"$a$".$When deciding between multiple vertices to visit next, always pick the vertex according to alphabetical order.$$For example, if you need to select between vertices $"$f$","$e$",$ and $"$b$",$ then select $"$b$".$ Which of the following edges are part of the spanning tree?$$Note that $"($a$,$b$)"$ is equivalent to $"($b$,$a$)".($a$,$b$)($a$,$c$)($b$,$c$)($b$,$d$)($d$,$e$)($c$,$e$)($c$,$f$)($e$,$f$)($f$,$g$)$