Prove that the recursive algorithm for the Towers of Hanoi produces the best possible solution, and that this solution is unique: i.e., that it is impossible to solve the puzzle in less than moves, and that there is only one way to do it with this many. Hint: prove this by induction on n. A recursive algorithm deserves a recursive proof.