Imagine you have $4$ disks labeled A$,$ B$,$ C$,$ and D$,$ and $3$ pegs marked as $1,2,$ and $3.$ The task is to transfer all $4$ disks from peg $A$ to peg $D.$ Illustrate the recursive steps by hand to accomplish the talsk. $[$Hint: review Tower of Hanoi Puzzle$]$