[Solved]1 Consider Following Graph Edge Weights Listed Table Ab Ac Ad Ae Ag Cd De Dh Eh Fg Fh Gh 4 Q37284533

1. Consider the following graph with edge weights listed in the table AB AC AD AE AG CD DE DH EH FG FH GH 4 4 2 (a) What is the cost of its minimum spanning tree? (b) How many minimum spanning trees does it have? (c) Suppose Kruskal’s algorithm is run on this graph. In what order are the edges added to the MST (in case of ties add the edge which is lexicographically first, that is, comes first in the table)? For each edge in this sequence, give a cut that justifies its addition. Show transcribed image text 1. Consider the following graph with edge weights listed in the table AB AC AD AE AG CD DE DH EH FG FH GH 4 4 2 (a) What is the cost of its minimum spanning tree? (b) How many minimum spanning trees does it have? (c) Suppose Kruskal’s algorithm is run on this graph. In what order are the edges added to the MST (in case of ties add the edge which is lexicographically first, that is, comes first in the table)? For each edge in this sequence, give a cut that justifies its addition.

Expert Answer

---

Answer to 1. Consider the following graph with edge weights listed in the table AB AC AD AE AG CD DE DH EH FG FH GH 4 4 2 (a) What… . . .