[solved]-Let G Undirected Graph Let X Subset Vertices G Connecting Tree X Tree Composed Edges G Con Q39039749

Let G be an undirected graph and let X be a subset of thevertices of G. A connecting tree on X is a tree composed out of theedges of G that contains all the vertices in X.

One way to compute a connecting tree consists of two steps:

(1) Compute a minimum spanning tree T over G.

(2) Delete all the edges out of T not needed to connect verticesin X.

Give an algorithm(Pseudo-code) to carry out step 2 abovein time θ(N) where N is the number of vertices in G.

Expert Answer

---

Answer to Let G be an undirected graph and let X be a subset of the vertices of G. A connecting tree on X is a tree composed out o… . . .