. Find a max flow in this network from s to t, and show the final flow value along each edge. Also indicate the vertex partition that forms a min cut, and show the edges that cross the min cut. Show max flow Show min cut s (570/47 bonu Desgn an algorithm whose input is a ist of n poes, run in Ofn)t