Please answer the following using an Java implementation.

Random connections. Develop a Uion-Find client program that takes an integer value N from the command line, generates random pairs of integers between 0 and N1, calling connected() to determine if they are connected and then union() the pair if not yet connected, looping until all sites are connected, and printing the number of connections generated. Package your program as a static method count() that takes N as argument and returns the number of connections and a main() that takes N from the command line, calls count () , and prints the returned value. Use the program you created to test hypothesis, called ErdoRenyi model, that the number of pairs generated to get one component is 21NlogN Random connections. Develop a Uion-Find client program that takes an integer value N from the command line, generates random pairs of integers between 0 and N1, calling connected() to determine if they are connected and then union() the pair if not yet connected, looping until all sites are connected, and printing the number of connections generated. Package your program as a static method count() that takes N as argument and returns the number of connections and a main() that takes N from the command line, calls count () , and prints the returned value. Use the program you created to test hypothesis, called ErdoRenyi model, that the number of pairs generated to get one component is 21NlogN