How many arrangements of 1, 2, 3, . . n are there in which only the odd integers must be deranged (even integers may be in their own positions)? [to make this easier, you can assume that n is even.] your answer should be a big sum in terms of n. check your answer for n = 2 and n = 4.