Discrete Structure - Old Questions

18. Find the recurrence relation to find the number of moves needed to solve the TOH (Tower of Hanoi) problem with n disks. Discuss application of recurrence relation in divide-and-conquer algorithms.