Double tower of hanoi: in this variation of the tower of hanoi there are three poles in a row and 2n disks, two each of n different sizes, where n is any positive integer. initially one of the poles contains all the disks placed on top of each other in pairs of decreasing size. disks are transferred one by one from one pole to another, but at no time may a larger disk be placed on top of a smaller disk. however, a disk may be placed on top of one of the same size. let tn be the minimum number of moves needed to transfer a tower of 2n disks from one pole to another.
(a) find t1 and t2. t1 = t2 =
(b) find t3. t3 =
(c) find a recurrence relation for t1, t2, t3, .