Consider the following algorithm for Tower of Hanoi puzzle. n is the input size, the number of disks you want to move from the source peg to the destination peg.

// Algorithm Hanoi (n , source , aux , dest )

if (n ==1)

print ( from + " ->" + dest )

else

Hanoi ( n-1 , from , dest , aux );

print ( from + " ->" + dest );

Hanoi ( n-1 , aux , from , dest ); \

Compute the running time of this algorithm and establish its order of growth.