[Part C] Prove or Disprove: The following divide and conquer algorithm correctly produces an MST of graph G. Given G, split it into two subgraphs, as close to each other in size as possible, recursively find the MST of each subgraph, and join the two MSTs via the lowest cost edge between them.