Consider a simple graph $G$ with $11$ vertices. What is the maximum possible number of edges $G$ can have if it is guaranteed to be triangle-free?