Figure 2 shows a flow network where every edge has a capacity. Given that the two vertices are source '0' and sink '5' in the network and the constraints are:- Flow on an edge does not exceed the given capacity of the edge. Incoming flow is equal to outgoing flow for every vertex except 0 and 5. 12 1 3 3 Source: 0 Sink: 5 16 20 10 4 7 5 13 4 2 4 14 Figure 24 (a) Based on the Ford-Fulkerson Algorithm, describe the steps to derive the maximum flow (b) Calculate the maximum flow from 0 to 52 (C) How can you prove the solution is optimal