proving bound on edges using Euler formula

Question

I want to prove the following result

Every $n$-vertex planar graph with $n\geq3$ and with girth $g$ has at most $\frac{g}{g-2}(n-2)$ edges.

Any hints? I have no idea. I don't see any useful link between the girth and the number of edges.