Network flow question.

3.4. Rank the following functions in increasing order of their growth rates for two cases: (1) when a network containing n nodes and m arcs is connected and very sparse [i.e., m = O(n)]; and (2) when the network is very dense [i.e., m = Q(n?)]. (a) n'm?, nm + n log n, nm log n, nm log(n2/m). (b) n2, m log n, m + n log n, m log log n. (c) n' log n, (m log n)(m + n log n), nm(log log n)log n