VTMO 2017 — Grade 5 — semifinal Question 8

Three pegs hold A on peg $1 , C$ above $B$ on peg $2$, and $D$ on peg $3$ as shown. Binh removes one disk at a time. How many removal orders are possible?