The dynamic set operation UNION takes two disjoint sets S 1 and S 2 as input, and it returns a set S S 1 S 2 consisting of all the elements of S 1 and S 2 The sets S 1 and S 2 are usually destroyed by the operation Show how to support UNION in O(1) time using a suitable list data structure ...

Here the rblem nditins re intended t enurge yu t stre the items f set s list strut ...

The dynamic-set operation UNION takes two disjoint sets S 1 and S 2 as input, and it

Question:

The dynamic-set operation UNION takes two disjoint sets S₁ and S₂ as input, and it returns a set S = S₁⋃ S₂ consisting of all the elements of S₁ and S₂. The sets S₁ and S₂ are usually destroyed by the operation. Show how to support UNION in O(1) time using a suitable list data structure.