(5) Cuts and Shortest Paths. Let G = (V, A) be a directed graph with arc capacity Wa = 1 for each arc a E A. Suppose that the shortest length path in G from s to t contains exactly k arcs. Prove that (a) The maximum s-t flow has value 0(). (b) The minimum capacity s - t cut has value OC). (5) Cuts and Shortest Paths. Let G = (V, A) be a directed graph with arc capacity Wa = 1 for each arc a E A. Suppose that the shortest length path in G from s to t contains exactly k arcs. Prove that (a) The maximum s-t flow has value 0(). (b) The minimum capacity s - t cut has value OC)