Let \(G = (V, E)\) be a weighted undirected graph and let \(T\) be a Minimum…

Let $G = (V, E)$ be a weighted undirected graph and let $T$  be a Minimum Spanning Tree ($MST$) of $G$ maintained using adjacency lists. Suppose a new weighed edge $(u, v) ∈ V×V$ is added to $G$. The worst case time complexity of determining if $T$ is still an $MST$ of the resultant graph is