Extremal Graph Theory and Ramsey Theory · Superchallenge problem

What is the maximum number of edges in a graph on $100$ vertices that contains no $K_4$?