VTMO 2026 - Grade 6 - Semifinal - SET 11 - Self-study Question 21

The diagram shows a game with three pegs and four discs $A,B,C,D$. Binh removes one disc at a time until all four discs have been removed. How many different removal orders are possible? A disc is lifted off the top of its peg.