I am having trouble with the following question:

Assume we have already found a minimum spanning tree `T`

for a weighted, undirected graph `G = (V,E)`

. We would like to be able to efficiently update `T`

should `G`

be altered slightly.

An edge is removed from `G`

to produce a new graph such that the new graph is still connected. Give an algorithm that uses `T`

to find a minimum spanning tree for the new graph in `O(|E|)`

time.