Isomorphism and Subgraphs · Challenge problem

$K_{3,3}$ has parts $\{1,2,3\}$ and $\{4,5,6\}$ with all $9$ cross edges. What is the minimum number of edges you must delete from $K_{3,3}$ to leave a graph isomorphic to the $6$-cycle $C_6$?