The towers of Hanoi is not the only little recursive procedure much loved by computer scientists. Another all-time favorite is n!, where n! = n(n – 1)! subject to the limiting condition that 0! = 1....

The towers of Hanoi is not the only little recursive procedure much loved by computer scientists. Another all-time favorite is n!, where n! = n(n – 1)! subject to the limiting condition that 0! = 1. Write a procedure in your favorite assembly language to compute n!. If you are not convinced that recursion is at times indispensable, try programming the Towers of Hanoi without using recursion and without simulating the recursive solution by maintaining a stack in an array. Be warned, however, that you will probably not be able to find the solution.