The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is :
ANSWER:- D)
T(n) = 2T(n − 1) + 1
This is dummy text. It is not meant to be read. Accordingly, it is difficult to figure out when to end it. But then, this is dummy text. It is not meant to be read. Period.
If you have any doubts then please let me know... ConversionConversion EmoticonEmoticon