Permutation Groups · Challenge problem

Nine books stand in the order $3,1,4,9,5,2,6,8,7$. We want to rearrange them to the order $1,2,3,4,5,6,7,8,9$ using the minimum number of swaps, where each swap exchanges any two books (not necessarily adjacent). What is the minimum number of swaps needed?