50. Use the Breadth-First Spanning Tree Search Algorithm to find a spanning tree of K. Start from vertex h. Remember, we start with vertex h being labeled 0. K6 a. Vertices that should be labeled as step 1: b. Vertices that should be labeled as step 2: c. Vertices that should be labeled as step 3: d. Edges that need to be removed to get a spanning tree:

6. Consider the following graph: 1 2 5 4 8 3 6 9 7 List the order in which the vertices are visited with a topological sort, as shown in class. Always process the vertex with the lowest number first if several vertices have indegree 0. 10

Kruskal's Algorithm: Kruskal's algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest. This algorithm is a Greedy Algorithm. The steps to find a MST using this algorithm are as follows: Sort all the edges in non-decreasing order of their weight. Pick the smallest edge. Check if it forms a cycle with the spanning tree formed so far. If cycle is not formed, include this edge. Else, discard it. Repeat step2 until there are (V-1) edges in the spanning tree. Example with 10 vertices and 20 weighted edges:

List the order in which Breadth First Search (BFS) would visit the vertices in the graph shown below if the BFS is started at vertex A. Break ties alphabetically. Give your answer as a comma separated list of vertices such as A, B, C, etc. A B 3 9. G 3 F I H 2 C 4 8 E 1 2. 9.