SCHWEITZER 2002 Problem 2

Let $G$ be a simple $k$ edge-connected graph on $n$ vertices and let $u$ and $v$ be different vertices of $G$ . Prove that there are $k$ edge-disjoint paths from $u$ to $v$ each having at most $\frac{20n}{k}$ edges.