Both questions 2 and 3.

2.Find a maximum a-z flow and minimum capacity a-z cut in the following networks:

3.Find a maximum flow from a to z in the network of Figure 4.9 (using the associated directed network). Also give a minimum capacity a-z cut.

2. Find a maximum az ow and minimum capacity az cut in the following networks: (a) (b) 3. Find a maximum ow from a to z in the network of Figure 4.9 (using the associated directed network). Also give a minimum capacity az cut