Let G=(V,E) be an undirected connected graph with distinct edge weights. You are given a minimum spanning tree T on G. You expect one of the edges of G to disappear at some time in the future, but you don't know which edge it will be, and when the edge does disappear, you'll need to find another minimum spanning tree very quickly. Give an efficient algorithm to preprocess T and G to label each edge e in T with another edge r(e) of G so that if e disappears, adding r(e) to the tree creates a new minimum spanning tree in the modified graph