What is the maximum number of edges in a triangle-free graph with $n$ vertices (Turan's Theorem application)?