Proof Writing & Problem Solving · Easy problem

Four cards read $3, 1, 4, 2$ from left to right. A move swaps two NEIGHBOURING cards. What is the fewest number of moves needed to put them in the order $1, 2, 3, 4$?