Choice Problem 6.8. Consider the flow network N below with source s and sink t (10) 110 110) (a) Find an augmenting path that uses at least one backward edge (b) Find the maximum flow value w() in N. List the augmenting paths in each iteration (c) Draw the auxilary weighted digraph N" coresponding to your maximum flow How do you know you have achieved a maximum flow (d) Find a cut (S,T) of N having minimum capacity and express w) in terms of the cut Choice Problem 6.8. Consider the flow network N below with source s and sink t (10) 110 110) (a) Find an augmenting path that uses at least one backward edge (b) Find the maximum flow value w() in N. List the augmenting paths in each iteration (c) Draw the auxilary weighted digraph N" coresponding to your maximum flow How do you know you have achieved a maximum flow (d) Find a cut (S,T) of N having minimum capacity and express w) in terms of the cut