Honorable Experts,

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

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

4. a) Find the maximum flow from source (node A ) to destination (node A ) from the following flow graph. Show the residual network at each step. b) Let G be a graph with three sources (s) , s2. s3). two sinks (11, 12) and a positive integer capacity on each edge. Explain how it can be converted to a standard maximum-flow problem. c) List the advantages and disadvantages of Dijkastra's Algorithm over Bellman-Ford's Algorithm