1- Identify the maximum flow from s to t 2- Identify the minimal cut set that guarantees such flow and another minimal cut set. 3- Assume all links have failure probability 1-p. What is the probability that the max flow reaches t from s? S 16 13 16 13 Consider Network in Figure 1 20 a 10 4 31 C 12 9. 12 14 b d 11 Figure 1: Network with associated capacities in the link. 7 20 4