2. Let G = (V, E) be a directed capacitated graph. Let 1: V x V R be defined by l(s, t) = capacity of the minimum s +t cut. Prove the following triangle inequality" for cuts: for all distinct s, t, u EV, 1(s, t) > min{(s, u), \(u,t)}. 2. Let G = (V, E) be a directed capacitated graph. Let 1: V x V R be defined by l(s, t) = capacity of the minimum s +t cut. Prove the following triangle inequality" for cuts: for all distinct s, t, u EV, 1(s, t) > min{(s, u), \(u,t)}