The Disjoint Set ADT To perform a Union of two sets,we merge the two trees by making the root pointer of one node point to the root node of the other tree.We have adopted the convention that the new root after the Union(X,y)is X. After Union(5,6) (4 00o00500 12345678The Disjoint Set ADT ◼ To perform a Union of two sets, we merge the two trees by making the root pointer of one node point to the root node of the other tree. We have adopted the convention that the new root after the Union(X, Y) is X. 1 2 3 4 5 6 7 8 After Union(5,6) 0 0 0 0 5 0 0 1 2 3 4 5 6 7 0 8