a) It can be assumed that each node in the minimum cost network flow problem has at least two arcs. Why? b) Sum of dual slacks for a cycle is a constant. What is it? c) On the picture below you can see a solution to find the shortest distance from A to F. Formulate this shortest path problem. 10 11 F E 3 B 151? C 2 A.