Consider the Turan graph $T(n, r)$, which is a complete $r$-partite graph with $n$ vertices. If $n=10$ and $r=3$, what is the maximum number of edges in a graph with $n=10$ vertices that does not contain $K_4$ as a subgraph?