Question 1 – Union-Lost Suppose you’re given a tree T and a sequence of queries, each of which are of the form described below (1) Remove edge e from the graph. It is guaranteed that e exists. (2) Given nodes u, in the tree, determine if they are in the same component. The above queries are interspersed among each other. That is, you may be asked to remove some edges, determine if some
OR
OR