please note all the question , and make what answer belong to what question, and don't use excel (handwriting)

st pumping 2. Consider the following directed network where S is the source node, N is the sink node, and the number along the ares denote the capacities of flows: for the next and $15 for ust be met mpany can production Excessive oduction be the starting s_ 15 212_ 74720 6 15 extent of en by the a) Illustrate the following notions with an example for the above network: (i) A path connecting S and N, (ii) A cut separating S and N, and (iii) The capacity of a cut. b) Find the maximum flow from Sto N using the augmenting path algorithm c) Find the minimum cut, and verify the max-flow min-cut theorem