Olympiad Number Theory · Superchallenge problem

A simple graph on $12$ vertices contains no $K_4$ (no four mutually adjacent vertices). What is the largest possible number of edges?