In the context of the baseball elimination problem, one can show that if w_i+g_i ≤ w_k + g_k and team k is eliminated, then team i is also eliminated. Use this fact to show that among a set of n teams, one can determine all the eliminated teams by solving O(log n) maximum flow problems.