1. Show that if ![533_53200961-482a-4499-91c8-eca26c014e7a.png](https://secure.tutorsglobe.com/CMSImages/533_53200961-482a-4499-91c8-eca26c014e7a.png)
2. Suppose that we know a noninteger maximum flow in a directed network with integer arc capacities. Suggest an algorithm for converting this flow into an integer maximum flow. What is the running time of your algorithm? (Hint: Send flows along cycles.)