3 Consider Following Pseudocode Disjoint Set Implementation Make Set X Rank X 0 Find Set X Q37111385

3. Consider the following pseudocode for a disjoint-set implementation Make-Set (x) rank [x] 0 Find-Set (x) return Find-Set (p Lx]) return x Link(x, y) if rank Cx] > rank[y] else if rankDx] – rank[y] rank[y] rank [y] 1 ← + Union(x,y) Link (Find-Set(x), Find-Set (y)) Show the data structure that results and the answers returned by the Find-Set operations in the following program for i ← 1 to 16 Make-Set (xi) for i+ 1 to 15 by 2

OR

 

OR