a. Does the maximum-flow problem always have a unique solution? Would your answer be different for networks with different capacities on all their edges?
b. Answer the same questions for the minimum-cut problem of finding a cut of the smallest capacity in a given network.