Problem 4. Consider the following greedy algorithm for computing the maximum number of edge disjoint s-to-t paths in a directed graph G = (V, E), with ste V. Compute any s-to-t path, remove it from the graph, and recurse. 1 Give an example to show that this greedy algorithm can produce results far from optimal. Specifically, construct a graph G = (V, E) with st V such that there are at least 1000 edge disjoint s-to-t-paths in G, but the greedy algorithm finds less than 10 edge disjoint paths. Problem 4. Consider the following greedy algorithm for computing the maximum number of edge disjoint s-to-t paths in a directed graph G = (V, E), with ste V. Compute any s-to-t path, remove it from the graph, and recurse. 1 Give an example to show that this greedy algorithm can produce results far from optimal. Specifically, construct a graph G = (V, E) with st V such that there are at least 1000 edge disjoint s-to-t-paths in G, but the greedy algorithm finds less than 10 edge disjoint paths