help game theory thx

5. Let H be a network with two marked vertices s and t with latency functions on each edge as in the usual setting of a ow problem. Let the FDA of H be a. Let G be a graph obtained from H by dropping some of the edges. Show that the average latency for any NE on G is at least 1 / (1 times the average latency for any NE on H. (This quanties the effect of dropping edges as we saw in Braess Paradox in lecture.)