***Please type your answer or write in print, because I have had great difficulty with understanding most handwritten assistance done in cursive or mixed print/cursive. (c) How would you generalize this idea? Suppose you are given a graph Gand a particular edge {u, v} in the graph. How would you alter Prim'salgorithm to find the minimum spanning tree subject to the condition that{u, v} is in the tree? PROBLEM 8An undirected weighted graph G is given below:3e4Figure 16: An undirected weighted graph has 6 vertices, a through f, and 9 edges.Verter d is on the left. Verter f is above and to the right of verter d. Vertex e isbelow and to the right of vertex f, but above vertex d. Verter c is below and to theright of vertex e. Verter a is above verter e and to the right of vertex c. Verterb is below and to the right of verter a, but above vertex c. The edges between thevertices and their weight are as follows: d and f, 1; d and e, 4; ƒ and e, 2; e and a,2; f and a, 3; е аnd c, 5; с and a, 7; с and b, 5; and a anпd b, 6.

Actually, graph is a non linear data structure which consisting of edges and nodes.C) In graph if there is a cycle it involves n vertices and n edges to have minimum MST,have to remove max weighted edge to get MST. If the specified edge involved in the MST of original prims algorithm, then cost will be the same. If the given edge cost is more then involving that edge will give different MST.