Can you come up with a technique to find the second best MST?Write the algorithm steps Analyze your algorithms time complexity in terms of the number of vertices V and number of edges E.

using Prims algorithms find out the Maximum Spanning Tree?

8 7 b 2 11 14 6 8 10 h 8 2 Figure 2: A weighted graph and its minimum spanning tree