Q. Recurrence equation formed for the tower of hanoi problem is given by
✅ Correct Answer: (C)
t(n) = 2t(n-1)+c
Explanation: as there are 2 recursive calls to n-1 disks and one constant time operation so the recurrence relation will be given by t(n)