What is the maximum number of edges in a graph with $n$ vertices that does not contain a $C_3$ (triangle) as a subgraph (Turan's Theorem application)?