2009 Fermat Problem 9

In the diagram, any \spadesuit may be moved to any unoccupied space. What is the smallest number of \spadesuit's that must be moved so that each row and each column contains three \spadesuit's?

\textbf{(A)}\ 1\quad \textbf{(B)}\ 2\quad \textbf{(C)}\ 3\quad \textbf{(D)}\ 4\quad \textbf{(E)}\ 5

If there are no answer choices shown, enter a numerical answer.

Full credit to this problem is given to the CEMC, you may view all Fermat contests here.