enumerative combinatorics

Hi, can anybody please help me or analyse this question for me please? I really have no idea how to even approach it. It says: Derive the exponential generating function (egf) for permutations having an even number of cycles and that of permutations having an odd number of cycles. There should show that for there are as many permutations with an even number of cycles as those having an odd number of cycles. Define a bijection which demonstrates this and illustrate it with an example. Can anybody please give me some suggestions please? I can't even get the question make sense to me.