Consider the following function fn.

int fn ( n )

{

if ( n == 0)

{

return 1;

}

int total = 0;

for ( int i =0; i < n ; i ++)

{ total += fn ( i ) ; }

return total ; }

What is the timecomplexity of this function ?