Honorable Experts, ITS MY 5TH TIME POST, STILL I COULD NOT FIND A PROPER ANSWER, PLEASE SOLVE THIS ACCORDING TO MY ANSWER. I WOULD BE ALWAYS GRATEFUL TO YOU .

could you please solve this with 100% accuracy? you have to solve this with questions instructions. please you have to show all your work. You have to draw a diagram then you can solve this problem .otherwise don't need to answer this.

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

YOU have to solve only - b & c . need main points as its carries 3+3 marks

/ Answer should be Handwritten.No computer type please .

###Give Graphical simulation for each step

b) Let G be a graph with three sourees (s1, s2, s3), two sinks (11, t2) and a positive integer sapucity on cach 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