Planar Graphs · Challenge problem

What is the minimum number of edges that must be deleted from $K_7$ (the complete graph on $7$ vertices) so that what remains is planar?