The Disjoint Set ADT In this part,we describe an efficient data structure to solve the eguivalence problem. ■ Relations:A relation R is defined on a set Sif for every pair of elements (a,b),a,bes,a Rb is either true or false.If a R b is true,then we say that a is related to 6.The Disjoint Set ADT ◼ In this part, we describe an efficient data structure to solve the equivalence problem. ◼ Relations: A relation R is defined on a set S if for every pair of elements (a, b), a, bS, a R b is either true or false. If a R b is true, then we say that a is related to b