llan Learning On the graph below, begin at vertex E. In applying the Nearest-Neighbor Algorithm to find a Hamiltonian circuit, vertex D would be visited first. Which vertex would be visited next? B 10 A 3 C 6 7 5 9 8 E 2 D O A OE OC O B ODSort the edges in the graph below from least to greatest. In applying Kruskal's Algorithm to find a minimum cost spanning tree, which edge would be the first cost NOT used in the list? 2 1 3 4 2 6 1 6 0 4 3 O 2Sort the edges in the graph below from least to greatest. In applying the SortedEdges Algorithm to nd a Hamiltonian circuit, which edge would be the rst cost NOT used in the list? On the graph below, which circuit is produced by using the NearestNeighbor Algorithm starting at vertex B? A 2 3 c 1 D Q BDACB Q B-C-DAB Q BCADB Q BDCAB In the graph below, vertiees represent coworkers in an ofce. Vertices are joined by an edge if those two people do not get along. The coworkers are driving to a wedding in Niagara Falls and would like to arrange a carpool. Use vertex coloring to determine the fewest number ofcars that would be needed so that no coworkers that do not get along are in the same car. @ 0/ \\o ..\\/ Consider the path represented by the sequence of numbered edges on the graph below. Which statement is true? 1 3 O The path is a circuit, but not an Euler circuit. C) The path is not a circuit. C) The path is an Euler circuit. \fIn which of the diagrams below do the red edges represent a spanning tree of the graph above?I O B only C) Neither A nor B O Both A and B O A only