Answered! Suppose we are given a directed graph G and suppose we have three different destinations d1,d2 and d3. We want to…

Suppose we are given a directed graph G and suppose we have three different destinations d1,d2 and d3. We want to find 3 paths from our start vertex u, one to each of the destinations and we want these 3 paths to be edge disjoint. Describe an efficient algorithm to find the paths and give the running time of your solution.