Please do not follow code from geeks for geeks. Ensure your code follows the sample input and output format correctly.

Kruskal's Algorithm:

Write a JAVA program to generate a Minimal Spanning Tree of a graph using Union$-$Find based

Kruskal's algorithm.

Input Format:

Adjacency List of Graph: $[$i$][$j$][$k$]$ with $\text{'}$i$\text{'}$ being source vertex id$,\text{'}j\text{'}$ being the number of edges,

each edge being $[$destination vertex id$,$ weight$]$

Sample Input:

$[$

$\left[\begin{array}{ccc}1& 7& 5\end{array}\right]$

$2,$

$\left[\begin{array}{ccccc}0& 7& 6& 20& 3\end{array}\right]$

$4$

$3$

$2,$

$\left[\begin{array}{cccc}0& 5& 6& 14\end{array}\right]$

$3$

$1,$

$\left[\begin{array}{cccc}1& 20& 14& 2\end{array}\right]$

$4$

$2$

$\left[\begin{array}{ccc}1& 3& 2\end{array}\right]$

$3$

$]$

Output Format

Adjacency List of MST: $[$i$][$j$][$k$]$ with $\text{'}$i$\text{'}$ being source vertex id$,\text{'}$j$\text{'}$ being the number of edges,

each edge being $[$destination vertex id$,$ weight$]$

Sample Output:

$\left[\begin{array}{cc}1& 7\end{array}\right]$

$[[4,3][2,6][0,7]]$

$\left[\begin{array}{cc}1& 6\end{array}\right]$

$\left[\begin{array}{cc}4& 2\end{array}\right]$

$[[3,2][1,3]]$