We assume that we have an edge-weighted graph (G) and a pre-calculated MST for this graph (with the Kruskal or Prim algorithm).In other words, we have the MST's edge information. Now we assume that we add a new node (W) and new weighted edges that connect the new node to a subset of the existing nodes of the line. We do not change old nodes and edges. Explain how to find the new line's MST in the fastest way (do not write pseudocode). Also, explain why it is the fastest way

This is my algorithms class so please just explain how to solve this algorithm and why it is the fastest way