please show the complete program along with the all the outputs

the screenshots of outputs are necessary

2. Let (S,T) be a cut in the flow network G with flow value f. Write a program in C or C++ to show that f=f(S,T) for any cut in G. Supply the above graph as input and verify the statement by considering at least 4 different cuts. Note that A is the source vertex and J is the sink vertex