Appreciate if you can answer this ONE QUESTION COMPLETELY and give me a detailed working with explanation for me to understand. Once completed so long as my doubts are cleared and the solutions are correct, I will definitely vote up. Some of the question are similiar to take a look carefully before you answer as it's very important for me.

Thank you

Question1 6 pts Use the maximum flow algorithm to find a maximum flow and a minimum cut in the given network, where the capacities of arc SA, AE, BD and DG are w-5, X-4, y-10, and z -12. ti 15 5 15 13 Key in the value of a maximum flow below