Let G = (V, E) be a flow network with source s and sink t. We say that an edge e is a bottleneck in G if it belongs to every minimum capacity cut separating s from t. Give a polynomial-time algorithm to determine if a given edge e is a bottleneck in G.