b) Calculate the time complexity of Tower of Hanoi problem.

Recursive Function for Solving Hanoi #include void hanoi (int n, char src, char dst, char aux) { if (n == 1) printf ("Move disc from peg %c to peg %c ", src, dst); else { hanoi (n-1, src, aux, dst); 1, hanoi (1, src, dst, aux); hanoi (n-1, aux, dst, src); } } int main() { hanoi (4, 'A', 'C', 'B'); return 0; } What's its time complexity