GATE Computer Science (CS) 2012 Solved Paper

Question : 26 of 65

Marks: +1, -0

The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with ṅ discs is