Suppose we have a graph G,

- We divide it into two graphs G1 and G2
- Form mst of G1 and G2 using divide and conquer
- Connect G1 and G2 with the lightest edge
- Repeat until the mst of whole graph is computed

I’m in confusion can it form mst of graph or not, please provide necessary explanation for your viewpoint.