As in the previous exercise, let f (u, ) be the distance from u to in the residual network G f. Show how

As in the previous exercise, let δ_f (u, ν) be the distance from u to ν in the residual network G_f. Show how to modify the generic push-relabel algorithm to maintain the property that u.h < |V| implies u.h = δ_f (u, t) and that u.h ≥ |V| implies u.h ≥ |V| = δ_f (u, s). The total time that your implementation dedicates to maintaining this property should be O(VE).