Imagine running a disjoint set in reverse, starting with no barns open and

iteratively opening them

At each point in time, we can see how many separate trees are in our

disjoint set.

If the answer is $1,$ then every open barn is connected, otherwise they are

not.

A relatively slight modification to a regular disjoint set class will answer this

query $($download disjoint set with path compression code$)$

Modify the disjoint set code into stand$-$alone disjoint class and add Main

class

Add a variable numTrees to Disjoint Set class, initialize the numTrees in the

constructor

Update the numTrees during Union if the Union is successful SolutionI need help finishing this JAVA Code. The rest of the code is correct I just need help with the class dset,public int find$($int id$),$public boolean union$($int id$1,$ int id$2),$ and the class pair. import java.util.$*$;

import java.io$.*$;

public class Main $\{$

public static int n;

public static int e;

public static ArrayList$[]$ graph;

public static void main$($String$[]$ args$)\{$

$//$ TODO Auto$-$generated method stub

Scanner scanner $=$ new Scanner$($System$.$in$)$;

$//$Read data

n $=$ scanner.nextInt$()$;

e $=$ scanner.nextInt$()$;

graph $=$ new ArrayList$[$n$]$;

for$($int i $=0$; i$()$;

$//$Read edges

for$($int i $=0$; i $$ e; i$++)\{$

int v$1=$ scanner.nextInt$()-1$;

int v$2=$ scanner.nextInt$()-1$;

graph$[$v$1].$add$($v$2)$;

graph$[$v$2].$add$($v$1)$;

$\}$

$//$ store items to be removed

int$[]$ remList $=$ new int$[$n$]$;

for$($int i$=0$; i$=0$; i$--)\{$

int item $=$ remList$[$i$]$;

for $($int j $=0$; j