Let G = (V,E) be an undirected graph with distinct edge weights d (u, v), i.e., no two edges have the same weight. Suppose you are already given I, a minimum spanning tree on G. However, one of the edges of G might disappear at any time randomly. E.g., if the graph represents a computer network between traders, one of the links might disappear due to network irregularities. When such an event occurs, your task is to find a new minimum spanning tree quickly. In the above example, you need to reestablish communication among the traders as soon as possible. Write an algorithm to generate a backup edge (e) for every edge e in I, so that if e disappears, creating a new graph G', adding (e) to T-(e) creates a new minimum spanning tree T' of G'. Please include a discussion about your idea and the pseudocode for your algorithm.