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