Honorable Experts,

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. (35) is 2012=82 (35) is 2012=0 the :0215 Step :: 024.1 Kenidu onperity (0+2)=2,(i+q)is,f(2=12+9+7 (9+3)77=0,(35)=2,19=1, : Th H=Fl+F1,12+1+7