Suppose we are given a supply and demand problem where the functions c, a, and d are integral. If there exists a feasible flow, is there an integral feasible flow as well? Show that a k-connected graph on n vertices contains at least _kn/2_ edges. (Note that this bound is tight; see [Har62].)