please post this as fast as possible as u can write a c program

Output: Number of Vertices : 6 Edges:10 A:0 B : 1 Capacity: 16 A :0 B :2 Capacity: 13 A:1 B: 1 Capacity: 10 A :2 B: 1 Capacity: 4 A :3 B : 2 Capacity: 9 A: 1 B:3 Capacity: 12 A:2 B :4 Capacity: 14 A : 4:3 Capacity: 7 A:3 B : 5 Capacity: 20 A: 4 B:5 Capacity: 4 Please enter source(S) and sink(t):25 Max flow : 15 Q. Writea cprogram for agiven a griaph which eepreuns a flow netwolk nohere erery edge nas a caparty. Ilso given two verticess owe and sink f'in the graph, find the maximumporsible flow flom s to f with gociowing coneraints caparity of the eage - Inwming fow is eqnal to ouryoing fow for every vertex except sand? The maximum possible flowin the a bovegraph is 23 Output: Number of Vertices : 6 Edges:10 A:0 B : 1 Capacity: 16 A :0 B :2 Capacity: 13 A:1 B: 1 Capacity: 10 A :2 B: 1 Capacity: 4 A :3 B : 2 Capacity: 9 A: 1 B:3 Capacity: 12 A:2 B :4 Capacity: 14 A : 4:3 Capacity: 7 A:3 B : 5 Capacity: 20 A: 4 B:5 Capacity: 4 Please enter source(S) and sink(t):25 Max flow : 15 Q. Writea cprogram for agiven a griaph which eepreuns a flow netwolk nohere erery edge nas a caparty. Ilso given two verticess owe and sink f'in the graph, find the maximumporsible flow flom s to f with gociowing coneraints caparity of the eage - Inwming fow is eqnal to ouryoing fow for every vertex except sand? The maximum possible flowin the a bovegraph is 23