Implement Kruskal's algorithm that computes the minimum spanning treeof an edge-weighted graph that is connected in C++. Use your implementation of the Union Find data type from the previous question. Demonstrate your implementation works for the following weighted not-connected graph.

8

16

4 5 0.35

4 7 0.37

5 7 0.28

0 7 0.16

1 5 0.32

0 4 0.38

2 3 0.17

1 7 0.19

0 2 0.26

1 2 0.36

1 3 0.29

2 7 0.34

6 2 0.40

3 6 0.52

6 0 0.58

6 4 0.93