Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2022/iii/paper-104/3/b/solution

The automorphism cyclically permutes the first letter and leaves the remaining suffix unchanged, so and .
In the section notation,
Thus . An automorphism satisfying fixes every finite word: repeatedly entering the third subtree eventually reaches the end of the word. Hence . Since , it is nonidentity, and both and have order three.

New to topics? Read the docs here!