In the Multicut problem, given an undirected graph G, a set of pairs of vertices P, and a budget k, the goal is to determine if there is a set S of at most k edges such that for each (s, t) is an element of P, the graph G ...