How would you find the second minimum spanning tree $($MST$)$ in a given graph? Second MST is the tree that connects all nodes with the second total minimum possible weight. The total weight in the second$-$MST should be larger than the total weight of edges in the first MST$.$

a$)$ Show your work on the graph How below, where the first MST is given $($second one should be different$)..$

b$)$ Analyze and provide the complexity of your algorithm

How would you find the second minimum spanning tree $($MST$)$ in a given graph? Second MST is the tree that connects all nodes with the second total minimum possible weight. The total weight in the secondMST should be larger than the total weight of edges in the first MST$.$

a$)$ Show your work on the graph How below, where the first MST is given $($second one should be different$).$

b$)$ Analyze and provide the complexity of your algorithm

PROBLEM $2$