Input Problem Directed Graph G V E Two Vertices U V Give Algorithm Checks Least 10 Edge Di Q37179419

The input for the problem are a directed graph G(V, E) and twovertices u, v. Give an algorithm that checks if there are at least10 edge disjoint paths from u to v.

Please write time complexity for the algorithm.

Answer