This question is from the subject Design and analysis of algorithm..

Do not copy and paste some text on the internet. Request to solve the question, answer the sub-questions clearly in your book, and paste photos.

I will like your genuine work

FAKE experts stay away

(a) In the flow network illustrated below, each directed edge is labelled with its capacity. We are using the Ford-Fulkerson algorithm to find the maximum flow. The filst augmenting path is S-A-C-D-T, and the second augmenting path is S-A-B-C-D-T. Draw the residual network after we have updated the flow using these two augmenting paths (in the order given)