This is a Permutation question, shown below.

Please explain clearly showing each step as thoroughly as possible.

If you are using hand-written notes, then please ensure they are tidy and legible as untidy written notes are difficult to interpret.

Alternatively use LaTeX.

Let g be an element of .35 with g = (123) (456) (in cycle notation). i. Determine the number of permutations in 33 that commute with 9. ii. Determine all the (cycle) types of 35 for which some permutation of that type commutes with 9. iii. For each of the types found in part (ii), determine the number of permutations of SE of this type that also commute with g