A complete graph with $6$ vertices is traversed using depth first search. The vertices are labeled A through F$.$ The search starts at vertex A and vertices are considered in alphabetical order. What is the resulting DFS tree?

Group of answer choices

Graph with vertices A through F$.$ There is an edge between every pair of vertices. All the edges are black, except for the red search edges between A and B$,$ B and C$,$ C and D$,$ D and E$,$ and A and F$.$

Graph with vertices A through F$.$ There is an edge between every pair of vertices. All the edges are black, except for the red search edges between A and B$,$ A and C$,$ A and D$,$ A and E$,$ and A and F$.$

Graph with vertices A through F$.$ There is an edge between every pair of vertices. All the edges are black, except for the red search edges between A and B$,$ B and C$,$ C and D$,$ D and E$,$ and E and F$.$

Graph with vertices A through F$.$ There is an edge between every pair of vertices. All the edges are black, except for the red search edges between F and A$,$ F and B$,$ F and C$,$ F and D$,$ and F and E$.$