Latest Gate Aptitude Question SOLUTION: The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is option (A) T(n) = 2T(n - 2) + 2 (B) T(n) = 2T(n - 1) + n (C) T(n) =