$10$ extra point problem

The Towers of Hanoi problem recursively moves n disks from tower A to tower B with the assistance of tower C as follows:

$1.$ Move the first n $-1$ disks from A to C with the assistance of tower B$.$

$2.$ Move disk n from A to B$.$

$3.$ Move n $-1$ disks from C to B with the assistance of tower A$.$

Solve the recurrence relation to find the time complexity, T$($n$),$ of this algorithm to move n disks from tower A to tower B$.$

Suppose a disk is moved at a rate of $1$ per second.

How many years would it take to move $32$ disks.

How many years would it take to move $64$ disks.