2.e.Il: Design (pseudo-code) an O(E+V) time algorithm, which given a graph G(V, E), a minimum spanning tree T of G, and an edge e(u,v) of T, computes the minimum spanning tree of the graph G obtained by removing e from G.(4 points) Remark 7. When an edge e(u,v) is removed from a tree T, its splits the tree T into two connected components. To get a minimum spanning tree after removing e from T, we just need to look at all the edges that cross the two components created by removal of e in T. In fact if you call one of these compoenents S, then the other will contain all the remaining vertices of G (denoted by V\S ). But to find S algorithmically, just find the connected component of u (or v if you prefer that). Hint: Use BFS/DFS in T with e removed to get connected component of u and call it S