BFS is run on the following graph. Assume C is the starting vertex and adjacent vertex iteration occurs in alphabetical order. F A E Which vertices are in frontierQueue before the first iteration of the while loop? Ex: A, В, С Which vertices are in discoveredSet after the first iteration of the while loop? Which vertices are in frontierQueue after the third iteration of the while loop? Which vertices are in discoveredSet after the third iteration of the while loop?

Let G be the following graph with 5 vertises: (4) O Write the incidence matrix of G. O Enter your incidence matrix on for other software) and use it to cakulate +the oumber ofpaths of length 10 stacbing at the vertex 1. How Many of these paths end at vertex 1? vertex 2, 3, 4, and5? Pari

Please make a graph by hand for each step. no code

2. Answer the following questions about the graph given below. B E a) Does an Euler circuit exist? Why or why not? b) Find a good eulerization for the graph, using as few duplicated edges as possible. How many edges must be added? c) Use the eulerization you developed in part b) to determine a best circuit for this graph, beginning at vertex A. List this path by listing successive vertices. 1 3. Consider the complete graph given below. 24 14 46 B, 32 51 28 a) Find the length of the sorted-edges tour for this graph. Use wiggly lines to indicate this tour. b) Find the length of the nearest-neighbor tour starting at vertex A. Use wiggly lines to indicate this tour.