Let $G$ be a connected, $4$-regular graph with $10$ vertices. What is the maximum number of connected components that can result from removing exactly $2$ edges from $G$?