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 $$i$$ being source vertex id$,$j$$ being the number of edges,

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

Sample Input:

$[$

$[[1,7],[2,5]],$

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

$[[0,5],[1,6],[3,14]],$

$[[1,20],[2,14],[4,2]]$;

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

$]$

Output Format

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

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

Sample Output:

$[[1,7]]$

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

$[[1,6]]$

$[[4,2]]$

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

NOTE$*$

REFER TO IMAGE FOR INPUT FORMAT CLARITY

ENSURE YOUR CODE FOLLOWS INSTRUCTIONS

DO NOT COPY FROM GEEKS FOR GEEKS OR USE CHATGPT THANK YOU I WILL UPVOTE! 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: