## Discussion Forum

Que. | The recurrence relation capturing the optimal time of the Tower of Hanoi problem with n discs is |

a. | T(n) = 2T(n – 2) + 2 |

b. | T(n) = 2T(n – 1) + n |

c. | T(n) = 2T(n/2) + 1 |

d. | T(n) = 2T(n – 1) + 1 |

Answer:T(n) = 2T(n – 1) + 1 |