35. Use the Breadth-First Spanning Tree Search Algorithm to find a spanning tree of K,. Start from vertex J. Remember, we start with vertex j being labeled 0. d h K. 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. Vertices that should be labeled as step 4: e. Edges that need to be removed to get a spanning tree:

a) Find the minimum spanning tree using prims algorithm. b) Write the sequence of edges added to the bree using the above . Prims algorimm. 50 O 45 40 www 5 30 20 25 55 35 5 d

Draw a minimum spanning tree for the following graph: 2 A В 3 G 7. F 4 H. 2 8 E 1 Draw a binary search tree using the following values in the order given: 12, 17, 4, 11, 19, 15, 6 LO to

Build the d table for the following graph if you use the breadth first search and start from node s. Remember that we use the alphabetical order rule Assume the blanks/boxes are for the following nodes. Each blank/box is for one node. starting from node r followed by s, t, u, v, w, x, and y, respectively. S t и V W y

1. List the vertices of a depth-first search starting at vertex A. Choose the alphabetically lower vertex when you have a choice.2. List the vertices of a breadth-first search starting at vertex A. Choose alphabetically lower vertex when you have a choice.