Honorable Experts,

This is my 5th-time post, Still I Could not get the right answer please solve this way. I would be always grateful to you.

could you please solve this with 100% accuracy? you have to solve this with questions and instructions. please you have to show all your work.

Course - CSE 373 - Data Structure ( Theory Part ) Don't Need to Write unnecessary coding part

// I added a sample question and process for how you have to solve it. please solve it like this. please otherwise answer would not be properly right.

Question - Please Solve Only A & B number.

Sample Way for solving problem -

4. a) Find the maximum flow from source (node A) to destination (node F ) from the following flow graph. Show 4 the residual network at each step. b) Let G be a graph with three sources (s1, s2, s3), two sinks (t1, t2) and a positive integer capacity on cuch edge. Explain how it can be converted to a standard maximum-flow problem. Find the maximum flow from source (node 0) to destination (node 5) from the following flow graph. Show the residual network at each step. Residual capacity. (01) is 1612=4,(13) is 12=12=0, (35) is 2012=8 step 0245 in riod (02)is=134=9,(24)is=(144)bottereck4Flow=12+4(45)=49=0 Residual copacity (01) is 1612=4,(1+3) is 12=12=0, (35) is 2012=8 stepr: 0245 - bl.ed teriave 1 capacity: (02) is =134=9,(24) is =(144)=10,bithereck4(95)=12+4 02435Wirered Residualcapoity(002)=2,(29)=3,Flow=12+9+7(93)=77=0,(35)=2019=1,TheMaxFlow=12+4+7=23