Planar Graphs · Hard problem

What is the crossing number of $K_5$, the fewest number of edge crossings in any drawing of the complete graph on $5$ vertices?