Let G(V,E) be an undirected graph, with positive weights given for its edges, and assume A and B are subsets of V . Define

(A, B) = min (x, y), xA, yB

Suggest an algorithm that computes (A, B) in time O((m + n) log n). Here (and in all graphs questions) n = |V | and m = |E|.