Solution
= 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$.
= 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$.