Task

Solve the   Towers of Hanoi   problem with recursion.




hanoi 8 ‘abc"
WHERE
hanoi 0 (a,b,c,) = ()
hanoi n ( a,b,c) = hanoi (n-1) (a,c,b) ,
                   ‘move a disc from " , a , ‘ to " , b , NL ,
                   hanoi (n-1) (c,b,a)
?