undefined

[40 Points] Use Depth-first search AND the Breadth-first search to produce the spanning tree for the given simple graph. Choose a as the root of this spanning tree and assume the vertices are ordered alphabetically. Draw and show each step. h d b [40 Points] Use Prims algorithms AND the Kruskals algorithm to find the minimum spanning tree for the given weighted graph. Draw and show each step. a 5 h 4 2 3 6 5 3 7 e 1 d f 6 3 4 8 4 4 h 2