Let $G = (X \cup Y, E)$ be a bipartite graph with $|X| = 5$ and $|Y| = 5$. If $G$ contains no cycles of length $4$ ($C_4$-free), what is the maximum number of edges $G$ can have?