A) Find with the Ford - Fulkerson algorithm maximum flow from x1 to X6, and cut network minimum starting from the initial flux given in the figure. B) Considering the numbers inside the brackets as the lengths of the arcs, find the distances minimum from vertex x1, to any other vertex as well as the shortest path from x1 to x6. use the dijkstra algorithm 8(10) 5 5(8) 5(6) 242) 4(4) 3(3) 11(13) 1 5(7) 5(6) 3(10) 6 2