The Disjoint Set ADT Notice that we do not perform any operations comparing the relative values of elements,but merely require knowledge of their location. For this reason,we can assume that all the elements have been numbered sequentially from 1 to M.Thus,initially we have s=for /1 through MThe Disjoint Set ADT ◼ Notice that we do not perform any operations comparing the relative values of elements, but merely require knowledge of their location. ◼ For this reason, we can assume that all the elements have been numbered sequentially from 1 to N. Thus, initially we have Si={i} for i=1 through N