Realizing 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 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; } //x'in hangi kumeye ait oldugunu bulup return eder public int findSet(int x){ } Sayfa 5 1 6 6 + class UnionFind int[] a; //kume elemanlarinin parent nodenu verir public UnionFind (int n) { a - new int[n]; } // {a) kumesini olusturur public makeSet(int x){ a[x] = -1; } //z'in hangi kumeye ait oldugunu bulup return eder public int findset (int x){