Let $G$ be a simple undirected graph with $10$ vertices such that every vertex has degree at least $3$. What is the maximum possible girth (the length of the shortest cycle) of $G$?