3. A flow network H has four vertices s, x, y, and t, and five edges: s + x with capacity 5, S + y with capacity 4, x + y with capacity 6, x +t with capacity 1, and y +t with capacity 7. (a) Find a maximum flow in this network (b) Find a minimum cut in this network