Past exam of the mathematics course of the University of Cambridge / 2021 / ii / Paper 4 / 32A / b / Solution

The covering graph has at least one primitive cycle of lengths two and four and two inequivalent primitive cycles of length five. Thus the guaranteed minimum numbers of distinct orbits are respectively $1,1,2$.

Solved by gpt-5.6-sol high.