- ) Write a recurrence relation of the following code and findthe time complexity.
void towerOfHanoi(int n, char from_rod,
                    charto_rod, char aux_rod)
{
    if (n == 1)
    {
        cout <<\"Move disk 1 from \" << from_rod << \" to \" <        return;
    }
    towerOfHanoi(n - 1, from_rod, aux_rod,to_rod);
    cout << \"Move disk \" << n<< \" from \" << from_rod << \" to \" << to_rod<< endl;
    towerOfHanoi(n - 1, aux_rod, to_rod,from_rod);
}
