# Hanoi relation

Computer Science Level 3

Which of the following recurrence relations correctly represents the optimal time for the Tower of Hanoi with $$n$$ discs?

×