Figure Q4 is a directed network diagram with ten nodes (labelled as A to J) where the number associated with each link is the capacity of that link. For examples, the node C to node D is 5 units per period, but node D to node C has no direct link. (a) Determine the maximum flow per period from node A to node J, and the set of paths for giving the maximum flow with capacity being used in each path. (b) Make a sketch of the network diagram in the answer book with the minimum cut to prove the set of paths obtained is the best result. (c) List out the set(s) of links that contributes to the bottleneck(s) of this network diagram. A 16 18 B 5 5 8 8 12 15 E F 5 15 18 8 6 5 8 H 7 17 10 6