Paths are Tur\'an-good

We show that among $K_{k+1}$-free $n$-vertex graphs, the Tur'an graph contains the most copies of any path.