Consider the Towers of Hanoi problem. Write a recursive function, TOH$($n$,$A$,$B$,$C$),$ where A$,$ B$,$ and C are

pegs. Pegs can contain stacks. A stack can never be on another stack where the latter is smaller than the

former. The peg A contains n number of stacks. The function should determine the sequence of

movement of stacks from one peg to another peg so that all stacks on A are moved to peg C by considering

peg B as an auxiliary peg.