Performing Union-find (disjoint set) data structure with forest-tree and union by rank UnionFind class is requested. In this class, a[i] gives the parent node of element i. E if a[i] is negative Node i is considered the root node and represents the cluster. Math.abs(a[i])-1 also gives the rank of the k ume indicated by this root. A Recall the uninon and findSet methods in the following class

Realizing Union-find (disioint set) data structure with forest-tree and union by rank UnionFind class is requested. In this class, a[i] gives the parent node of elementi. E if a[i] is negative Node i is considered the root node and represents the cluster: Math.abs(a[i])-1 value also gives the rank of this root cluster. Perform uninon and findset methods in the following class. class UnionFind int[] a; //kume elemanlarinin parent nodenu verir public UnionFind(int n){ a = new int[n]; } // {x} kumesini olusturur public makeSet(int x){ a[x] = -1; } // Finds which cluster x belongs to and returns it public int findSet(int x){ } 1/ joins clusters of x and y according to the "union by rank" method public int union(int x, int y){ } }