The maximum number of copies of an even cycle in a planar graph

We resolve a conjecture of Cox and Martin by determining asymptotically for every $k\ge 2$ the maximum number of copies of $C_{2k}$ in an $n$-vertex planar graph.