Eulerian and Hamiltonian Graphs · Challenge problem

What is the minimum number of edges that must be deleted from the complete graph $K_5$ so that NO Hamiltonian cycle remains among the surviving edges?