Let G be a connected weighted undirected graph with n vertices and m edges. Design an O(k(n+m)) algorithm to find a minimum spanning tree of G if all edges have integer weights in the range 1...k.