2. Create a polynomial-time algorithm for solving the following problem. As input, the algorithm [10] receives an undirected graph G (V, E), and two subsets of vertices X,Y S V such that X Y = %. As output, the algorithm must decide if it is possible to find a collection of X| paths {P.lu e X) in G (that is, one path for each vertex in ) such that all the paths are vertex-disjoint and, for each u e Xthe path P starts at u and ends at some vertex in Y