Consider the following generalization of the maximum flow problem.You are given a directed network G = (V, E) with edge capacities {ce}. Instead of a single (s,t)pair, you are given multiple pairs (s1,t1),(s2,t2), . . . ,(sk,tk), where the si are sources of G and theti are sinks of G. You are also given k demands d1, . . . , dk. The goal is to find k flows f(1), . . . , f(k)with the following properties: f(i)is a valid flow from si to ti. For each edge e, the total flow f(1)e + f(2)e + + f(k)e does not exceed the capacity ce. The size of each flow f(i)is at least the demand di. The size of the total flow (the sum of the flows) is as large as possible.How would you solve this problem?

Elementary Statistics Notes Amanda Selly 8/29/2016 Mean: average To find the mean you add up all the values and then divide by the number of values you have o Population mean: µ= x1+x2+x3+…+xN/N µ= Σx/N o Sample mean: ~x= x1+x2+x3+…+xn/n µ= Σx/n Please note that sample mean is indicated by an x with a bar on...