Directed Graphs and Network Flows · Hard problem

A digraph has vertices $1,\dots,6$ with arcs $1\to2$, $2\to1$, $4\to5$, $5\to6$, $6\to4$, $2\to3$, $1\to4$. What is the minimum number of new arcs that must be added so the digraph becomes strongly connected?