Planar Graphs · Hard problem

What is the minimum number of edges that must be deleted from $K_6$ so that what remains can be drawn with no two edges crossing?