9. Minimum cost flow Path:s→2→1→t,fow:5,cost:4, total:20. Path:s→l→t,flow:2,cost:5, total:10 Path:s→2→3→t,flow:3,cost:6, total:18 Total cost 489. Minimum cost flow Path: s → 2 → 1 → t, flow: 5, cost: 4, total: 20. Path: s → 1 → t, flow: 2, cost: 5, total: 10. Path: s → 2 → 3 → t, flow: 3, cost: 6, total: 18. Total cost: 48