Let's assume that we have an edge-weighted graph (G) and a pre-calculated MST for this graph (with the Kruskal or premium algorithm) (in other words, we have edge information that makes up the MST). Express in your own sentences the algorithm that finds the second-best MST for this graph. The second best MST of a line is the tree that traverses all the nodes of the line and the total weight of the edges it travels through is the second least possible weight for that line.