Generalizing on the notion of a cut-set, we define a k-way cut-set in an undirected graph as a set of edges whose removal breaks the graph into k or more connected components. Show that the randomized contraction algorithm can be modified to find a minimum k-way cut-set in n^O(k) time.