Argue informally but preciselythat any algorithm to solve the Towers of Hanoi Problem of size N must use Ω(N + c) bits of storage, where c is a constant.  

(HINT: how many distinct states must be maintained over the run of the program according to your analysis above?  What is the absolutely most compact way to represent those in binary?  What else must be stored besides these states, and how

much space does it take?)

Solve the one question above in the next couple hours.