(b) (8 points) Double Target Flow: In a standard flow network, we are given a directed graph G - (V, E), which has a non-negative capacity c(e) on each edge eeE a source vertex s and a target vertex t. A flow is an assignment of non-negative values to the edges, such that there is flow conservation at all V\ [s,t), and no capacity is violated. A max flow is a valid flow maximizing the net amount of flow leaving s A double target flow network is the same except now there are two targets, t and t2, and instead we require flow conservation at the vertices in V\s, t1,t2) (and capacity constraints are still enforced). Just as in the single target case, a max flow in a double target flow network is a valid flow maximizing the net flow leaving s. Give an algorithm to compute the max flow in a double target flow network, assuming you have a black box which correctly computes the max flow in any standard flow network. (b) (8 points) Double Target Flow: In a standard flow network, we are given a directed graph G - (V, E), which has a non-negative capacity c(e) on each edge eeE a source vertex s and a target vertex t. A flow is an assignment of non-negative values to the edges, such that there is flow conservation at all V\ [s,t), and no capacity is violated. A max flow is a valid flow maximizing the net amount of flow leaving s A double target flow network is the same except now there are two targets, t and t2, and instead we require flow conservation at the vertices in V\s, t1,t2) (and capacity constraints are still enforced). Just as in the single target case, a max flow in a double target flow network is a valid flow maximizing the net flow leaving s. Give an algorithm to compute the max flow in a double target flow network, assuming you have a black box which correctly computes the max flow in any standard flow network