This question already has an answer here:
Figured this needs to broken down case by case, where case one is whenever the permutation is even, and case two is when it is odd. Whenever a permutation is odd, then the product of that permutation with a 4-cycle is even, and so I figure we need only show this for whenever it is even.
My other way would be to show that each transposition can be written as the product of four cycles, but I'm a bit lost on this, since four-cycle is itself the product of three transpositions. This was the way to do it.