3. [10 pts You are given an undirected graph G (V, E). A certain collection of nodes DCV are designated as dangerous and a certain collection of nodes S C V is designated as safe (assume Dns- 0). In an emergency, we want a set of evacuation routes from the dangerous nodes to the safe ones. A set of evacuation routes is defined as a set of paths in G such that: .. each node in D is the tail of one path, ii. the last node on each path lies in S, iii. no two paths share any nodes in common. Such a collection lets the populations of D escape to S without overly congesting any edge in G Given G, D, and S, give a polynomial time algorithm to decide if a set of evacuation routes exists in. 3. [10 pts You are given an undirected graph G (V, E). A certain collection of nodes DCV are designated as dangerous and a certain collection of nodes S C V is designated as safe (assume Dns- 0). In an emergency, we want a set of evacuation routes from the dangerous nodes to the safe ones. A set of evacuation routes is defined as a set of paths in G such that: .. each node in D is the tail of one path, ii. the last node on each path lies in S, iii. no two paths share any nodes in common. Such a collection lets the populations of D escape to S without overly congesting any edge in G Given G, D, and S, give a polynomial time algorithm to decide if a set of evacuation routes exists in