A graph $G$ is called $k$-degenerate if every subgraph of $G$ has a vertex of degree at most $k$. If a graph has $n=10$ vertices and is 2-degenerate, what is the maximum number of edges it can have?