Network Flow Question-Consider Network in Figure 1

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?

26

12

12

16

13

b

20

16

10

S

13

3/

C

7

14

d

Figure 1: Network with associated capacities in the link.