How many edges must a connected graph on $V = 10$ vertices have to guarantee it is 2-connected (cannot be disconnected by removing a single vertex)?