A graph is triangle-free if it contains no cycles of length 3. What is the maximum number of edges in a triangle-free graph with 6 vertices?