Planar Graphs · Superchallenge problem

What is the minimum number of edges that must be deleted from $K_{12}$ (the complete graph on $12$ vertices) so that what remains is BOTH planar and bipartite?