Question 3: Single-path routing for bandwidth optimization Consider a given network represented by a directed graph G = (V, E). For each edge e, the capacity c(e) is given. For each flow between a sources and a destination t, a path p needs to be chosen so that the bandwidth along the path is maximized. For a given path p, the bandwidth of the path is the minimum capacity of an edge in the path. Thus the problem we need to solve is, max min c(e), PEPs,t eep (1) to route information from a source s to destination t. 1) Modify the Bellman-Fold algorithm to solve this routing problem between all sources and destinations. 2) State the properties of the proposed algorithm 3) Prove that it finds the optimal solution.