Paths of given length in tournaments

We prove that every $n$-vertex tournament has at most $n(n/2)^k$ directed $k$-edge paths.