Write this Kruskal's Algorithmprogram in Python 3.0 that will work with 'in2_edges.txt' and 'in3_edges.txt'

Example files that should be used for debugging...

'inExample_edges.txt'

vertices A=0, B=1,C=2,D=3,E=4,F=5

Graph edges: vertice1 vertice2 weight_of_the_edge 0 1 4 0 2 1 1 2 3 1 3 6 1 4 5 1 5 4 2 3 4 3 4 2 3 5 3 4 5 2

'outExample_edges.txt' (This is after Kruskal's Algorithm is implemented)

Graph edges: vertice1, vertice2, weight of the edge

edge: 0, 1, 4 edge: 0, 2, 1 edge: 1, 2, 3 edge: 1, 3, 6 edge: 1, 4, 5 edge: 1, 5, 4 edge: 2, 3, 4 edge: 3, 4, 2 edge: 3, 5, 3 edge: 4, 5, 2

Kruskal spanning tree edges: vertice1, vertice2, weight of the edge

edge: 0, 2, 1 edge: 3, 4, 2 edge: 4, 5, 2 edge: 1, 2, 3 edge: 1, 5, 4

Kruskal spanning tree weight is 12

'in2_edges.txt'

Graph edges: vertice1 vertice2 weight_of_the_edge 0 1 4 0 2 1 1 2 7 1 3 3 2 5 2 3 4 5 3 5 6 3 6 4 4 7 9 4 8 8 5 6 7 5 10 12 5 11 3 6 7 5 6 12 11 7 8 4 7 15 3 8 9 7 8 13 11 8 14 5 9 27 6 10 11 5 10 18 7 11 15 2 11 23 4 12 13 5 13 16 4 14 25 8 15 16 5 15 21 1 16 25 6 17 18 4 18 19 3 19 20 6 19 22 7 20 25 2 21 24 8 21 25 4 22 23 5 22 24 6 25 27 3 25 37 1 26 27 1 26 28 7 27 28 5 27 29 8 28 33 3 29 30 2 29 38 4 29 39 7 30 31 3 30 35 4 31 32 4 33 34 6 33 39 5 34 35 7 34 36 4 35 36 8 35 40 11 36 42 5 37 43 9 37 44 8 38 41 10 38 43 3 39 40 4 39 41 6 40 42 3 41 42 7 41 44 2 42 45 5 42 48 4 43 44 6 44 46 11 45 46 12 45 47 10 46 47 9 47 48 3 'in3_edges.txt'

Graph edges: vertice1 vertice2 weight_of_the_edge 0 1 4 0 2 1 1 2 7 1 3 3 2 5 2 3 4 5 3 5 6 3 6 4 4 7 9 4 8 8 5 6 7 5 10 12 5 11 3 6 7 5 6 12 11 7 8 4 7 15 3 8 9 8 8 13 11 8 14 5 9 27 6 10 11 3 10 18 7 11 15 2 11 23 3 12 13 5 13 16 4 14 25 8 15 16 3 15 21 1 16 25 5 17 18 4 18 19 3 19 20 6 19 22 7 20 25 2 21 24 8 21 25 4 22 23 5 22 24 6 25 27 3 25 37 2 26 27 1 26 28 7 27 28 5 27 29 6 28 33 3 29 30 2 29 38 4 29 39 7 30 31 2 30 35 3 31 32 4 33 34 3 33 39 5 34 35 7 34 36 4 35 36 8 35 40 3 36 42 5 37 43 9 37 44 8 38 41 10 38 43 3 39 40 4 39 41 6 40 42 3 41 42 7 41 44 2 42 45 5 42 48 4 43 44 6 44 46 8 45 46 12 45 47 10 46 47 9 47 48 3