A graph $G$ is said to be $k$-degenerate if every subgraph has a vertex of degree at most $k$. What is the maximum number of edges in a 2-degenerate graph with $n$ vertices?